On a conjecture of Randic index and graph radius

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Randic Structure of a Graph

Let G be a collection of graphs with n vertices. We present a simple description of [G]χ = {H ∈ G : χ(H) = χ(G)} where χ denotes the Randić index. We associate to G a Q-linear map ρ : Qm → Qk (for some integers k, m depending on G) such that the kernel of ρ contains the necessary information to describe [G]χ in terms of linear equations. These results provide precise tools for analyzing the beh...

متن کامل

On the hamiltonian index and the radius of a graph

Catlin et al. [1, Corollary 9A] characterised the graphs G with the property that ham(G) > rad(G) + 1 where ham(G) and rad(G) stand for the hamiltonian index and the radius of G, respectively. Here a slightly stronger result is presented. In effect, the graphs for which ham(G) > rad(G) holds are characterised in a similar way.

متن کامل

Some Bounds on the Modified Randic Index

In this paper, we present some new lower and upper bounds for the modified Randic index in terms of maximum, minimum degree, girth, algebraic connectivity, diameter and average distance. Also we obtained relations between this index with Harmonic and Atom-bond connectivity indices. Finally, as an application we computed this index for some classes of nano-structures and linear chains.

متن کامل

Ashwini Index of a ‎Graph

Motivated by the terminal Wiener index‎, ‎we define the Ashwini index $mathcal{A}$ of trees as‎ begin{eqnarray*}‎ % ‎nonumber to remove numbering (before each equation)‎ ‎mathcal{A}(T) &=& sumlimits_{1leq i

متن کامل

The generalized Randic index of trees

The Generalised Randić index R−α(T ) of a tree T is the sum over the edges uv of T of (d(u)d(v))−α where d(x) is the degree of the vertex x in T . For all α > 0, we find the minimal constant βc = βc(α) such that for all trees on at least 3 vertices R−α(T ) ≤ βc(n + 1) where n = |V (T )| is the number of vertices of T . For example, when α = 1, βc = 15 56 . This bound is sharp up to the additive...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Filomat

سال: 2015

ISSN: 0354-5180,2406-0933

DOI: 10.2298/fil1506369d