Wiener index of graphs with radius two

DOI10.1155/2013/906756zbMath1264.05043OpenAlexW1973404689WikidataQ59000394 ScholiaQ59000394MaRDI QIDQ1952734

Yanyan Li

Publication date: 3 June 2013

Published in: ISRN Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/906756

zbMATH Keywords

molecular graphsum of distancesgiven radiusminimum Wiener index

Mathematics Subject Classification ID

Applications of graph theory (05C90) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (6)

On maximum Wiener index of trees and graphs with given radius ⋮ Maximum size of digraphs of given radius ⋮ Extremal total distance of graphs of given radius I ⋮ General Randić indices of a graph and its line graph ⋮ Graphs with a given diameter that maximise the Wiener index ⋮ Bounding the \(k\)-Steiner Wiener and Wiener-type indices of trees in terms of eccentric sequence

Cites Work

• On the Wiener index of random trees
• Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts
• Spanning trees with many leaves and average distance
• Maximum induced trees in graphs
• On the sum of all distances in a graph or digraph
• Wiener index of trees: Theory and applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Wiener index of graphs with radius two