Name
Title | ||
|---|---|---|
On the extremal cacti of given parameters with respect to the difference of zagreb indices |
Abstract | ||
|---|---|---|
The first and the second Zagreb indices of a graph G are defined as \(M_1(G)= \sum _{v\in V_G}d_v^2 \) and \( M_2(G)= \sum _{uv\in E_G}d_ud_v\), where \(d_v,\, d_u\) are the degrees of vertices \(v,\, u\) in G. The difference of Zagreb indices of G is defined as \(\Delta M(G)=M_2(G)-M_1(G)\). A cactus is a connected graph in which every block is either an edge or a cycle. Let \(\mathscr {C}_{n,k}\) be the set of all n-vertex cacti with k pendant vertices and let \(\mathscr {C}_n^r\) be the set of all n-vertex cacti with r cycles. In this paper, the sharp upper bound on \(\Delta M(G)\) of graph G among \(\mathscr {C}_{n,k}\) (resp. \(\mathscr {C}_n^r\)) is established. Combining the results in Furtula et al. (Discrete Appl Math 178:83–88, 2014) and our results obtained in the current paper, sharp upper bounds on \(\Delta M(G)\) of n-vertex cacti and n-vertex unicyclic graphs are determined, respectively. All the extremal graphs are characterized. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s10878-019-00391-4 | Journal of Combinatorial Optimization |
Keywords | Field | DocType |
Degree (of vertex), The first Zagreb index, The second Zagreb index | Graph,Combinatorics,Vertex (geometry),Upper and lower bounds,Connectivity,Mathematics | Journal |
Volume | Issue | ISSN |
38 | 2 | 1573-2886 |
Citations | PageRank | References |
0 | 0.34 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shuchao Li | 1 | 183 | 35.15 |
| Licheng Zhang | 2 | 0 | 0.34 |
| Minjie Zhang | 3 | 0 | 0.34 |