Wiener Indices of Maximal k-Degenerate Graphs
A graph is maximal k-degenerate if each induced subgraph has a vertex of degree at most k and adding any new edge to the graph violates this condition. In this paper, we provide sharp lower and upper bounds on Wiener indices of maximal k-degenerate graphs of order n≥ k≥ 1. A graph is chordal if every induced cycle in the graph is a triangle and chordal maximal k-degenerate graphs of order n≥ k are k-trees. For k-trees of order n≥ 2 k+ 2 , we characterize all extremal graphs for the upper bound.
|Work Title||Wiener Indices of Maximal k-Degenerate Graphs|
|License||In Copyright (Rights Reserved)|
|Publication Date||January 9, 2021|
|Publisher Identifier (DOI)||
|Deposited||May 27, 2022|
This resource is currently not in any collection.