On the Randi\'c energy of caterpillar graphs
Abstract
A caterpillar graph T(p1, …, pr) of order n= r+Σi=1r pi, r≥ 2, is a tree such that removing all its pendent vertices gives rise to a path of order r. In this paper we establish a necessary and sufficient condition for a real number to be an eigenvalue of the Randi\'c matrix of T(p1, …, pr). This result is applied to determine the extremal caterpillars for the Randi\'c energy of T(p1,…, pr) for cases r=2 (the double star) and r=3. We characterize the extremal caterpillars for r=2. Moreover, we study the family of caterpillars T(p,n-p-q-3,q) of order n, where q is a function of p, and we characterize the extremal caterpillars for three cases: q=p, q=n-p-b-3 and q=b, for b∈ \1,…,n-6\ fixed. Some illustrative examples are included.
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.