cut-vertex;
distance;
pendant vertex;
unicyclic graph;
Wiener index;
05C05;
05C12;
05C35;
D O I:
暂无
中图分类号:
学科分类号:
摘要:
The Wiener index of a connected graph is defined as the sum of the distances between all unordered pairs of its vertices. We characterize the graphs which extremize the Wiener index among all graphs on n vertices with k pendant vertices. We also characterize the graph which minimizes the Wiener index over the graphs on n vertices with s cut-vertices.
机构:
Department of Mathematics, Indian Institute of Technology Bombay, Mumbai,400076, IndiaDepartment of Applied Mathematics, National Sun Yat-sen University, Kaohsiung City,804, Taiwan
机构:
Univ Kragujevac, Fac Sci, PB Box 60, Kragujevac 34000, Serbia
State Univ Novi Pazar, Novi Pazar, SerbiaUniv Kragujevac, Fac Sci, PB Box 60, Kragujevac 34000, Serbia
Gutman, Ivan
Jamil, Muhammad Kamran
论文数: 0引用数: 0
h-index: 0
机构:
Govt Coll Univ, Abdus Salam Sch Math Sci, Lahore, PakistanUniv Kragujevac, Fac Sci, PB Box 60, Kragujevac 34000, Serbia
Jamil, Muhammad Kamran
Akhter, Naveed
论文数: 0引用数: 0
h-index: 0
机构:
Govt Coll Univ, Abdus Salam Sch Math Sci, Lahore, PakistanUniv Kragujevac, Fac Sci, PB Box 60, Kragujevac 34000, Serbia
机构:
Shanghai Univ, Dept Math, Shanghai 200444, Peoples R China
Chongqing Normal Univ, Coll Math Sci, Chongqing 400047, Peoples R ChinaShanghai Univ, Sch Management, Shanghai 200444, Peoples R China
Wang, Dingguo
Shan, Erfang
论文数: 0引用数: 0
h-index: 0
机构:
Shanghai Univ, Sch Management, Shanghai 200444, Peoples R China
Shanghai Univ, Dept Math, Shanghai 200444, Peoples R ChinaShanghai Univ, Sch Management, Shanghai 200444, Peoples R China