First and Second Maximum of Randi\'c Index Among all k-Cyclic Graphs of a Given Order
Abstract
Suppose G is a simple graph with edge set E(G). The Randi\'c index R(G) is defined as R(G)=Σuv∈ E(G)1degG(u)degG(v), where degG(u) denotes the vertex degree of u in G. In this paper, the first and second maximum of Randi\'c index among all n-vertex k-cyclic graphs were computed.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.