Wiener index of graphs with radius two

DOI10.1155/2013/906756zbMATH Open1264.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)

Cites Work

• Wiener index of trees: Theory and applications
• On the sum of all distances in a graph or digraph
• Maximum induced trees in graphs
• Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts
• On the Wiener index of random trees
• Spanning trees with many leaves and average distance
• 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?)

Cited In (9)

• Selected topics on Wiener index
• General Randić indices of a graph and its line graph
• Graphs with a given diameter that maximise the Wiener index
• The Wiener index of the corona two graphs \(C_m \circ C_n\)
• Extremal total distance of graphs of given radius I
• On maximum Wiener index of trees and graphs with given radius
• Bounding the \(k\)-Steiner Wiener and Wiener-type indices of trees in terms of eccentric sequence
• Orientations of graphs with maximum Wiener index
• Maximum size of digraphs of given radius

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

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