Hypoenergetic and strongly hypoenergetic trees

Simple item page
dc.creatorLi, Xueliang
dc.creatorMa, Hongping
dc.date2009-05-25
dc.date2009-05-26
dc.date.accessioned2026-07-07T13:17:52Z
dc.date.available2026-07-07T13:17:52Z
dc.descriptionThe energy $E(G)$ of a graph $G$ is defined as the sum of the absolute values of the eigenvalues of $G$. An $n$-vertex graph is said to be hypoenergetic if $E(G)<n$ and strongly hypoenergetic if $E(G)<n-1$. In this paper, we consider hypoenergetic and strongly hypoenergetic trees. For any given $n$ and $Δ$, the existence of both hypoenergetic and strongly hypoenergetic trees of order $n$ and maximum degree $Δ$ is completely characterized.
dc.description8 pages
dc.identifierhttps://arxiv.org/abs/0905.3944
dc.identifierhttp://arxiv.org/abs/0905.3944
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/231256
dc.subjectCombinatorics
dc.subject05C50; 05C90; 15A18; 92E10
dc.titleHypoenergetic and strongly hypoenergetic trees
dc.typetext

Files

Collections

arXiv