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

DOI10.1016/J.AML.2010.08.032zbMATH Open1223.05052OpenAlexW2012828163MaRDI QIDQ609972

Min-jie 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

diameterbipartite graphsZagreb indices

Mathematics Subject Classification ID

Vertex degrees (05C07) Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) 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?)
• Title not available (Why is that?)
• Maximizing the sum of the squares of the degrees of a graph
• On the maximum and minimum Zagreb indices of graphs with connectivity at most \(k\)
• An upper bound on the sum of squares of degrees in a graph
• On the spectral radius of bipartite graphs with given diameter
• Trees of extremal connectivity index
• Sharp bounds for the second Zagreb index of unicyclic graphs
• Sums of powers of the degrees of a graph
• Minimizer graphs for a class of extremal problems
• 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
• Extreme values of the sum of squares of degrees of bipartite graphs

Cited In (17)

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

This page was built for publication: Sharp upper bounds for Zagreb indices of bipartite graphs with a given diameter

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