Remark on upper bounds of Randi´c index of a graph

Autor: M. P. Bekakos, I. Z. Milovanovic, P. M. Bekakos, E. I. Milovanovic
Rok vydání: 2016
Předmět:
Zdroj: Creative Mathematics and Informatics. 25:71-75
ISSN: 1843-441X
1584-286X
DOI: 10.37193/cmi.2016.01.09
Popis: Let G = (V, E) be an undirected simple graph of order n with m edges without isolated vertices. Further, let d1 ≥ d2 ≥ · · · ≥ dn be vertex degree sequence of G. General Randic index of graph ´ G = (V, E) is defined by Rα = X (i,j)∈E (didj ) α, where α ∈ R − {0}. We consider the case when α = −1 and obtain upper bound for R−1.
Databáze: OpenAIRE