Wiener indices of maximal \(k\)-degenerate graphs

DOI10.1007/s00373-020-02264-8zbMath1459.05048arXiv1908.09202OpenAlexW3118595818MaRDI QIDQ2657107

Zhongyuan Che, Allan Bickle

Publication date: 17 March 2021

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

Full work available at URL: https://arxiv.org/abs/1908.09202

zbMATH Keywords

\(k\)-treeWiener indexApollonian networkmaximal \(k\)-degenerate graph

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)

Related Items (7)

Wiener index in graphs with given minimum degree and maximum degree ⋮ Extremal decompositions for Nordhaus-Gaddum theorems ⋮ Extremal problems for connected set enumeration ⋮ On Wiener index and average eccentricity of graphs of girth at least 6 and \((C_4, C_5)\)-free graphs ⋮ Unnamed Item ⋮ \(k\)-Wiener index of a \(k\)-plex ⋮ \(k\)-paths of \(k\)-trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mean distance in a graph
• An upper bound on Wiener indices of maximal planar graphs
• Structural results on maximal k-degenerate graphs
• On the sum of all distances in a graph or digraph
• Edge-vulnerability and mean distance
• Distance in graphs
• The number of labeled k-dimensional trees
• k-Degenerate Graphs

This page was built for publication: Wiener indices of maximal \(k\)-degenerate graphs