Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter

DOI10.1016/j.aml.2010.08.032zbMath1223.05052MaRDI QIDQ609972

Minjie Zhang, Shuchao Li

Publication date: 1 December 2010

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

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

zbMATH Keywords

diameter; bipartite graphs; Zagreb indices

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C12: Distance in graphs

92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)

05C07: Vertex degrees

Related Items

Unnamed Item, Extremal tetracyclic graphs with respect to the first and second Zagreb indices, Further results on the reciprocal degree distance of graphs, The Zagreb indices of four operations on graphs, On extremal Zagreb indices of trees with given domination number, Extremal values on Zagreb indices of trees with given distance \(k\)-domination number, The Zagreb indices of graphs based on four new operations related to the lexicographic product, 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, Computing SS index of certain dendrimers, On the Kirchhoff index of bipartite graphs with given diameters, Zeroth-order general Randić index of cactus graphs, Sharp upper bounds for multiplicative Zagreb indices of bipartite graphs with given diameter, On the extremal cacti of given parameters with respect to the difference of Zagreb indices, Comparing the Zagreb indices of the NEPS of graphs

Cites Work

• On the maximum and minimum Zagreb indices of graphs with connectivity at most \(k\)
• On the connectivity index of trees
• On the extremal Zagreb indices of graphs with cut edges
• On the maximum Zagreb indices of graphs with \(k\) cut vertices
• On the spectral radius of bipartite graphs with given diameter
• Extreme values of the sum of squares of degrees of bipartite graphs
• An upper bound on the sum of squares of degrees in a graph
• Maximizing the sum of the squares of the degrees of a graph
• Sharp bounds for the second Zagreb index of unicyclic graphs
• Sums of powers of the degrees of a graph
• Trees of extremal connectivity index
• Minimizer graphs for a class of extremal problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item