On the maximum and minimum Zagreb indices of graphs with connectivity at most \(k\)

DOI10.1016/J.AML.2009.08.015zbMATH Open1201.05028OpenAlexW1998944033MaRDI QIDQ710976

Haibing Zhou, Shuchao Li

Publication date: 25 October 2010

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2009.08.015

zbMATH Keywords

connectivitytopological indexZagreb indexedge connectivity

Mathematics Subject Classification ID

Applications of graph theory (05C90) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Maximizing the sum of the squares of the degrees of a graph
• An upper bound on the sum of squares of degrees in a graph
• Trees of extremal connectivity index
• Sharp bounds for the second Zagreb index of unicyclic graphs
• Sums of powers of the degrees of a graph
• On acrylic and unicyclic conjugated graphs with maximum Zagreb indices
• Minimizer graphs for a class of extremal problems
• On the connectivity index of trees
• Extreme values of the sum of squares of degrees of bipartite graphs
• Extremal \((n,n + 1)\)-graphs with respected to zeroth-order general Randić index

Cited In (25)

• Extremal graphs for Estrada indices
• Sharp bounds of the Zagreb indices of \(k\)-trees
• Sharp upper bounds on Zagreb indices of bicyclic graphs with a given matching number
• Maximum Zagreb index, minimum hyper-Wiener index and graph connectivity
• Sharp bounds for the Zagreb indices of bicyclic graphs with \(k\)-pendant vertices
• The Zagreb indices of graphs based on four new operations related to the lexicographic product
• Sharp bounds for Zagreb indices of maximal outerplanar graphs
• The Laplacian-energy like of graphs
• On the spectral radius and energy of the weighted adjacency matrix of a graph
• Sharp bounds on the reduced second Zagreb index of graphs with given number of cut vertices
• Title not available (Why is that?)
• On the sharp lower bounds of Zagreb indices of graphs with given number of cut vertices
• On the extremal cacti of given parameters with respect to the difference of Zagreb indices
• Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter
• Zagreb, Harary and hyper-Wiener indices of graphs with a given matching number
• The first and the second Zagreb indices of the generalized Mycielskian of graphs
• The Zagreb indices of four operations on graphs
• On maximum Zagreb indices of bipartite graphs with a given connectivity
• On extremal bipartite graphs with a given connectivity
• On the reduced second Zagreb index of trees
• Sharp bounds on the zeroth-order general randić indices of conjugated bicyclic graphs
• Extremal tetracyclic graphs with respect to the first and second Zagreb indices
• On the monotonicity of topological indices and the connectivity of a graph
• Sharp bounds for the modified multiplicative Zagreb indices of graphs with vertex connectivity at most k
• The Zagreb indices of graphs with a given clique number

This page was built for publication: On the maximum and minimum Zagreb indices of graphs with connectivity at most \(k\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q710976)