AbstractA conjecture of Delorme, Favaron and Rautenbach [On the Randić index, Discrete Math. 257 (2002) 29–38] about the Randić index of a graph, in relation to its order and minimum degree, is refuted by the AutoGraphiX 2 system. Moreover, a modified conjecture is derived from presumably extremal graphs obtained with that system
AbstractLet G be a graph with order n and minimum degree δ(≥2). Erdős et al. found an upper bound of...
AbstractThe ordinary generalized geometric–arithmetic index of graphs is introduced and some propert...
AbstractThe Randić index R(G) of a graph G is defined by R(G)=∑uv1d(u)d(v), where d(u) is the degree...
AbstractThe Randić index R(G) of a graph G is defined by R(G)=∑uv1d(u)d(v), where d(u) is the degree...
AbstractThe Randić index R(G) of a graph G is defined as the sum of 1dudv over all edges uv of G, wh...
AbstractLet G(n,m) be a connected graph without loops and multiple edges which has n vertices and m ...
AbstractThe general Randić index of a molecular graph G is the sum of [d(u)d(v)]α over all edges uv∈...
AbstractThe Randić index R(G) of a graph G is defined by R(G)=∑uv1d(u)d(v), where d(u) is the degree...
For a given graph G = (V, E), the degree mean rate of an edge uv ∈ E is a half of the quotient betw...
© 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
AbstractLet G be a graph and d(u) denote the degree of a vertex u in G. The zeroth-order general Ran...
AbstractThe Randić index of a simple connected graph G is defined as ∑uv∈E(G)(d(u)d(v))-1/2. In this...
AbstractWe prove three results about the spectral radius μ(G) of a graph G:(a)Let Tr(n) be the r-par...
AbstractWe resolve conjectures of AutoGraphiX relating the index and the matching number of connecte...
AbstractWe prove that for every connected 4-colourable graph G of order n and minimum degree δ≥1, di...
AbstractLet G be a graph with order n and minimum degree δ(≥2). Erdős et al. found an upper bound of...
AbstractThe ordinary generalized geometric–arithmetic index of graphs is introduced and some propert...
AbstractThe Randić index R(G) of a graph G is defined by R(G)=∑uv1d(u)d(v), where d(u) is the degree...
AbstractThe Randić index R(G) of a graph G is defined by R(G)=∑uv1d(u)d(v), where d(u) is the degree...
AbstractThe Randić index R(G) of a graph G is defined as the sum of 1dudv over all edges uv of G, wh...
AbstractLet G(n,m) be a connected graph without loops and multiple edges which has n vertices and m ...
AbstractThe general Randić index of a molecular graph G is the sum of [d(u)d(v)]α over all edges uv∈...
AbstractThe Randić index R(G) of a graph G is defined by R(G)=∑uv1d(u)d(v), where d(u) is the degree...
For a given graph G = (V, E), the degree mean rate of an edge uv ∈ E is a half of the quotient betw...
© 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
AbstractLet G be a graph and d(u) denote the degree of a vertex u in G. The zeroth-order general Ran...
AbstractThe Randić index of a simple connected graph G is defined as ∑uv∈E(G)(d(u)d(v))-1/2. In this...
AbstractWe prove three results about the spectral radius μ(G) of a graph G:(a)Let Tr(n) be the r-par...
AbstractWe resolve conjectures of AutoGraphiX relating the index and the matching number of connecte...
AbstractWe prove that for every connected 4-colourable graph G of order n and minimum degree δ≥1, di...
AbstractLet G be a graph with order n and minimum degree δ(≥2). Erdős et al. found an upper bound of...
AbstractThe ordinary generalized geometric–arithmetic index of graphs is introduced and some propert...
AbstractThe Randić index R(G) of a graph G is defined by R(G)=∑uv1d(u)d(v), where d(u) is the degree...
DOI
Add to ORKG