Sums of powers of the degrees of graphs with \(k\) cut edges

DOI10.1007/s00373-010-0996-8zbMath1234.05131MaRDI QIDQ659742

Lixia Yan, Shuchao Li

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0996-8

zbMATH Keywords

Clique; Cut edges; Cycle; Zeroth-order general Randić index

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

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

05C07: Vertex degrees

Related Items

Degree powers in \(K_{s,t}\)-minor free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index
• On zeroth-order general Randić index of conjugated unicyclic graphs
• Cyclic edge-cuts in fullerene graphs
• More on ``Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index
• On the extremal Zagreb indices of graphs with cut edges
• On unicycle graphs with maximum and minimum zeroth-order general Randić index
• Maximal value of the zeroth-order Randić index
• Maximizing the sum of the squares of the degrees of a graph
• On the spectral radius of graphs with cut edges
• The sum of the squares of degrees: sharp asymptotics
• Extremal \((n,n + 1)\)-graphs with respected to zeroth-order general Randić index
• Sums of powers of the degrees of a graph