共 50 条
SHARP BOUNDS FOR THE GENERAL RANDIC INDEX R-1 OF A GRAPH
被引:2
|作者:
Milovanovic, E. I.
[1
]
Bekakos, P. M.
[2
]
Bekakos, M. P.
[3
]
Milovanovic, I. Z.
[1
]
机构:
[1] Fac Elect Engn, A Medvedeva 14,POB 73, Nish 18000, Serbia
[2] Xanthi Univ Technol, Dept Elect & Comp Engn, Xanthi 67100, Thrace, Greece
[3] Democritus Univ Thrace, Dept Elect & Comp Engn, GR-67100 Xanthi, Thrace, Greece
关键词:
General Randic index;
vertex degree sequence;
normalized Laplacian spectrum (of graph);
D O I:
10.1216/RMJ-2017-47-1-259
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
Let G be an undirected simple, connected graph with n >= 3 vertices and m edges, with vertex degree sequence d >= d 2 >=....>= d n. The general Randic index is de fi ned by R-1 = Sigma((i,j)subset of E) 1/d(i)d(j) Lower and upper bounds for R-1 are obtained in this paper.
引用
收藏
页码:259 / 266
页数:8
相关论文