Extremum modified first Zagreb connection index of \(n\)-vertex trees with fixed number of pendent vertices
From MaRDI portal
Publication:2187984
DOI10.1155/2020/3295342zbMath1461.05228OpenAlexW3018737108MaRDI QIDQ2187984
Akbar Ali, Akhlaq Ahmad Bhatti, Sadia Noureen
Publication date: 3 June 2020
Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/3295342
Extremal problems in graph theory (05C35) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal values on Zagreb indices of trees with given distance \(k\)-domination number
- Zagreb indices and multiplicative Zagreb indices of Eulerian graphs
- Extremal \(k\)-generalized quasi unicyclic graphs with respect to first and second Zagreb indices
- Inverse problem for Zagreb indices
- Trees of extremal connectivity index
- Tetracyclic graphs with maximum second Zagreb index: A simple approach
- Leap Zagreb indices of trees and unicyclic graphs
- On leap Zagreb indices of graphs
- Generalized Zagreb index of product graphs
- Some properties of the Zagreb indices
- Beyond the Zagreb indices
- A study on some properties of leap graphs
- Laplacian coefficients and Zagreb indices of trees
- A novel graph invariant: The third leap Zagreb index under several graph operations
This page was built for publication: Extremum modified first Zagreb connection index of \(n\)-vertex trees with fixed number of pendent vertices