Extremal tetracyclic graphs with respect to the first and second Zagreb indices
From MaRDI portal
Publication:5134459
DOI10.22108/toc.2016.12878zbMath1463.05087OpenAlexW3023914845MaRDI QIDQ5134459
N. Habibi, Ali Reza Ashrafi, Zadeh Tayebeh Dehghan
Publication date: 16 November 2020
Full work available at URL: https://doaj.org/article/72a569ec8b564c579892eb912a347dfa
Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Vertex degrees (05C07) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number
- Tetracyclic graphs with extremal values of Randić index
- The Zagreb coindices of graph operations
- Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter
- On the Zagreb indices of the line graphs of the subdivision graphs
- Extremal polyomino chains with respect to Zagreb indices
- On the maximum and minimum Zagreb indices of graphs with connectivity at most \(k\)
- Maximum values of atom-bond connectivity index in the class of tetracyclic graphs
- New upper bounds on Zagreb indices
- The first and second Zagreb indices of some graph operations
- The Zagreb indices of graphs with a given clique number
- Comparing the Zagreb indices of the NEPS of graphs
- Maximum values of atom-bond connectivity index in the class of tricyclic graphs
- Sharp bounds on Zagreb indices of cacti with k pendant vertices