Photo by goumbik from unsplash
The Randić index of a graph G, denoted by R(G), is defined as the sum of 1/d(u)d(v) for all edges uv of G, where d(u) denotes the degree of a… Click to show full abstract
The Randić index of a graph G, denoted by R(G), is defined as the sum of 1/d(u)d(v) for all edges uv of G, where d(u) denotes the degree of a vertex u in G. In this note, we show that R(L(T))>n4 for any tree T of order n≥3. A number of relevant conjectures are proposed.
Keywords:
index;
line graph;
randi index;
index line
Journal Title: Axioms
Year Published: 2022
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Axioms
Year Published: 2022
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!