On the minimal energy of conjugated unicyclic graphs with maximum degree at most 3

preprint2014arXivOpen access

Abstract

The energy of a graph GG, denoted by E(G)E(G), is defined as the sum of the absolute values of all eigenvalues of GG. Let nn be an even number and Un\mathbb{U}_{n} be the set of all conjugated unicyclic graphs of order nn with maximum degree at most 33. Let Snn2S_n^{\frac{n}{2}} be the radialene graph obtained by attaching a pendant edge to each vertex of the cycle Cn2C_{\frac{n}{2}}. In [Y. Cao et al., On the minimal energy of unicyclic Hückel molecular graphs possessing Kekulé structures, Discrete Appl. Math. 157 (5) (2009), 913--919], Cao et al. showed that if n≥8n\geq 8, Snn2≆G∈UnS_n^{\frac{n}{2}}\ncong G\in \mathbb{U}_{n} and the girth of GG is not divisible by 44, then E(G)>E(Snn2)E(G)>E(S_n^{\frac{n}{2}}). Let AnA_n be the unicyclic graph obtained by attaching a 44-cycle to one of the two leaf vertices of the path Pn2−1P_{\frac{n}{2}-1} and a pendent edge to each other vertices of Pn2−1P_{\frac{n}{2}-1}. In this paper, we prove that AnA_n is the unique unicyclic graph in Un\mathbb{U}_{n} with minimal energy.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.