On the extremal cacti of given parameters with respect to the difference of zagreb indices

Shuchao Li (), Licheng Zhang () and Minjie Zhang
Additional contact information
Shuchao Li: Central China Normal University
Licheng Zhang: Central China Normal University
Minjie Zhang: Hubei University of Arts and Science

Journal of Combinatorial Optimization, 2019, vol. 38, issue 2, No 6, 442 pages

Abstract: 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 $$ M 1 ( G ) = ∑ v ∈ V G d v 2 and $$ M_2(G)= \sum _{uv\in E_G}d_ud_v$$ M 2 ( G ) = ∑ u v ∈ E G d u d v , where $$d_v,\, d_u$$ d v , d u are the degrees of vertices $$v,\, u$$ v , u in G. The difference of Zagreb indices of G is defined as $$\Delta M(G)=M_2(G)-M_1(G)$$ Δ 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}$$ C n , k be the set of all n-vertex cacti with k pendant vertices and let $$\mathscr {C}_n^r$$ 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)$$ Δ M ( G ) of graph G among $$\mathscr {C}_{n,k}$$ C n , k (resp. $$\mathscr {C}_n^r$$ 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)$$ Δ M ( G ) of n-vertex cacti and n-vertex unicyclic graphs are determined, respectively. All the extremal graphs are characterized.

Keywords: Degree (of vertex); The first Zagreb index; The second Zagreb index (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-019-00391-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:38:y:2019:i:2:d:10.1007_s10878-019-00391-4

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-019-00391-4

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().