DETOUR INDEX OF A CLASS OF UNICYCLIC GRAPHS

被引:14
作者
Qi, Xuli [1 ]
Zhou, Bo [1 ]
机构
[1] S China Normal Univ, Dept Math, Guangzhou 510631, Guangdong, Peoples R China
关键词
distance; detour distance; detour index; unicyclic graph; WIENER INDEXES; MATRIX;
D O I
10.2298/FIL1001029Q
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The detour index of a connected graph is defined as the sum of detour distances between all unordered pairs of vertices. We determine the n-vertex unicyclic graphs whose vertices on its unique cycle all have degree at least three with the first, the second and the third smallest and largest detour indices respectively for n >= 7.
引用
收藏
页码:29 / 40
页数:12
相关论文
共 22 条
  • [1] AMIC D, 1995, CROAT CHEM ACTA, V68, P53
  • [2] [Anonymous], 1990, Distance in Graphs
  • [3] Chartrand G., 2005, Journal of Combinatorial Mathematics and Combinatorial Computing, V53, P75
  • [4] Diudea MV, 1998, CROAT CHEM ACTA, V71, P459
  • [5] Wiener index of trees: Theory and applications
    Dobrynin, AA
    Entringer, R
    Gutman, I
    [J]. ACTA APPLICANDAE MATHEMATICAE, 2001, 66 (03) : 211 - 249
  • [6] Du ZB, 2010, MATCH-COMMUN MATH CO, V63, P101
  • [7] Du ZB, 2009, ARS COMBINATORIA, V93, P97
  • [9] IVANCIUC O, 1994, MATCH-COMMUN MAT MAY, P141
  • [10] ON DETOURS IN GRAPHS
    KAPOOR, SF
    KRONK, HV
    LICK, DR
    [J]. CANADIAN MATHEMATICAL BULLETIN, 1968, 11 (02): : 195 - &