On maximum Wiener index of trees and graphs with given radius
Kinkar Ch. Das () and
M. J. Nadjafi-Arani ()
Additional contact information
Kinkar Ch. Das: Sungkyunkwan University
M. J. Nadjafi-Arani: Mahallat Institute of Higher Education
Journal of Combinatorial Optimization, 2017, vol. 34, issue 2, No 19, 574-587
Abstract:
Abstract Let G be a connected graph of order n. The long-standing open and close problems in distance graph theory are: what is the Wiener index W(G) or average distance $$\mu (G)$$ μ ( G ) among all graphs of order n with diameter d (radius r)? There are very few number of articles where were worked on the relationship between radius or diameter and Wiener index. In this paper, we give an upper bound on Wiener index of trees and graphs in terms of number of vertices n, radius r, and characterize the extremal graphs. Moreover, from this result we give an upper bound on $$\mu (G)$$ μ ( G ) in terms of order and independence number of graph G. Also we present another upper bound on Wiener index of graphs in terms of number of vertices n, radius r and maximum degree $$\Delta $$ Δ , and characterize the extremal graphs.
Keywords: Graph; Tree; Wiener index; Average distance; Radius; Maximum degree; 05C07 (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)
Downloads: (external link)
http://link.springer.com/10.1007/s10878-016-0092-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:34:y:2017:i:2:d:10.1007_s10878-016-0092-y
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878
DOI: 10.1007/s10878-016-0092-y
Access Statistics for this article
Journal of Combinatorial Optimization is currently edited by Thai, My T.
More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().