If G is a molecular graph with n vertices and if ?1, ?2, ..., ?n are its
eigenvalues, then the energy of G is equal to E(G) = |?1| + |?2|+ ... +
|?n|. If E(G) > 2n - 2, then G is said to be hyperenergetic. We show that no
H?ckel graph (= the graph representation of a conjugated hydrocarbon within
the H?ckel molecular orbital model) is hyperenergetic.
Energy of a graph is an interesting parameter related to total π electron energy of the corresponding molecule. Recently Vaidya and Popat defined a pair of new graphs and obtained their energy in terms of the energy of original graph. In this paper we generalize the construction and obtain their energy. Also we discuss the spectrum of the first level thorn graph of a graph.
Abstract.A dendroid is a connected semigraph without a strong cycle. In this paper, we obtain the various results on the enumeration of the non-isomorphic dendroids containing two edges and the dendroids with three edges.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.