Abstract
Some of the most comprehensively studied degree-based topological indices are the Zagreb indices. The first Zagreb index (Formula presented.) of a graph G is defined as the sum of squares of the degrees of the vertices. Let (Formula presented.) and let (Formula presented.) be the graph obtained from the simple graph G, by attaching a self-loop to each of its vertices belonging to X. In this article, some sharp bounds for the first Zagreb index of graphs with self-loops using various parameters has been put forward.
| Original language | English |
|---|---|
| Pages (from-to) | 326-331 |
| Number of pages | 6 |
| Journal | AKCE International Journal of Graphs and Combinatorics |
| Volume | 20 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 2023 |
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics
Fingerprint
Dive into the research topics of 'On the first Zagreb index of graphs with Self-Loops'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver