First Zagreb index and edge-vertex domination in trees
- 29 May 2024
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
- Vol. 17 (03)
Abstract
Let [ ] be a simple connected graph. The first Zagreb index denoted by [ ] is defined as [ ]. We present a lower bound for [ ] in terms of order and edge-vertex domination number for trees and characterized the extremal trees attaining the bound.Keywords
This publication has 7 references indexed in Scilit:
- Edge-vertex domination in treesDiscrete Mathematics, Algorithms and Applications, 2021
- An improved upper bound of edge–vertex domination number of a treeInformation Processing Letters, 2018
- Some extremal properties of the multiplicatively weighted Harary index of a graphJournal of Combinatorial Optimization, 2014
- On the maximum and minimum Zagreb indices of graphs with connectivity at mostApplied Mathematics Letters, 2010
- Average distance and domination numberDiscrete Applied Mathematics, 1997
- Graph theory and molecular orbitals. XII. Acyclic polyenesThe Journal of Chemical Physics, 1975
- Graph theory and molecular orbitals. Total φ-electron energy of alternant hydrocarbonsChemical Physics Letters, 1972