English

On the Randi\'{c} energy of caterpillar graphs

Combinatorics 2021-07-27 v1 Spectral Theory

Abstract

A caterpillar graph T(p1,,pr)T(p_1, \ldots, p_r) of order n=r+i=1rpin= r+\sum_{i=1}^r p_i, r2r\geq 2, is a tree such that removing all its pendent vertices gives rise to a path of order rr. 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)T(p_1, \ldots, p_r). This result is applied to determine the extremal caterpillars for the Randi\'c energy of T(p1,,pr)T(p_1,\ldots, p_r) for cases r=2r=2 (the double star) and r=3r=3. We characterize the extremal caterpillars for r=2r=2. Moreover, we study the family of caterpillars T(p,npq3,q)T\big(p,n-p-q-3,q\big) of order nn, where qq is a function of pp, and we characterize the extremal caterpillars for three cases: q=pq=p, q=npb3q=n-p-b-3 and q=bq=b, for b{1,,n6}b\in \{1,\ldots,n-6\} fixed. Some illustrative examples are included.

Keywords

Cite

@article{arxiv.2107.11422,
  title  = {On the Randi\'{c} energy of caterpillar graphs},
  author = {Domingos M. Cardoso and Paula Carvalho and Roberto C. Díaz and Paula Rama},
  journal= {arXiv preprint arXiv:2107.11422},
  year   = {2021}
}

Comments

16 pages, 5 figures, 3 tables