Abstract
We present lower and upper bounds on the general multiplicative Zagreb indices for bicyclic graphs of a given order and number of pendant vertices. Then, we generalize our methods and obtain bounds for the general multiplicative Zagreb indices of tricyclic graphs, tetracyclic graphs and graphs of given order, size and number of pendant vertices. We show that all our bounds are sharp by presenting extremal graphs including graphs with symmetries. Bounds for the classical multiplicative Zagreb indices are special cases of our results.
| Original language | English |
|---|---|
| Article number | 514 |
| Journal | Symmetry |
| Volume | 12 |
| Issue number | 4 |
| DOIs | |
| State | Published - 1 Apr 2020 |
Bibliographical note
Publisher Copyright:© 2020 by the authors.
Keywords
- Bicyclic graph
- Multiplicative Zagreb index
- Pendant vertex
- Tricyclic graph
ASJC Scopus subject areas
- Computer Science (miscellaneous)
- Chemistry (miscellaneous)
- General Mathematics
- Physics and Astronomy (miscellaneous)
Fingerprint
Dive into the research topics of 'General multiplicative Zagreb Indices of graphs with a small number of cycles'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver