Equienergetic chemical trees

By V. Brankov, Dragan Stevanovic, Ivan Gutman. 2004

64 citations recorded by the source corpus.

The energy E(G )o f ag raphG is the sum of the absolute values of the eigenvalues of G. Two graphs, G1 and G2, are said to be equienergetic if E(G1 )= E(G2). We report here the results of the search for pairs of equienergetic acyclic molecular graphs (chemical trees) with the same number n of vertices. There are very few such pairs. The smallest has n =9 and pertains to 3,3-diethylpentane and 3-methyloctane. Among the chemical trees with n 18, only five more such pairs and a triplet were found.

Subfields: Computational Theory and Mathematics, Geometry and Topology, Organic Chemistry

View Paper: https://www.semanticscholar.org/paper/33a31b6dfb03e2ca81dda830cbcab6bfa5ae72e4

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Ambat Vijayakumar
2. Gopalapillai Indulal

In Geometry and Topology

1. Ambat Vijayakumar
2. Gopalapillai Indulal

In Organic Chemistry

1. Ambat Vijayakumar
2. Gopalapillai Indulal

Citations in the corpus

• DISTANCE SPECTRA AND DISTANCE ENERGIES OF ITERATED LINE GRAPHS OF REGULAR GRAPHS (2009, unknown): “reported [1, 2, 3 , 20, 21, 22, 23, 24, 25, 26, 28, 29, 30, 32, 33].”
• On Distance Energy of Graphs (2010, background): “(2), has been much discussed and numerous examples of this kind were put forward [1,2,17–21,25–28].”
• On a Pair of Equienergetic Graphs (2008, unknown): “Equienergetic graphs were constructed also in [5-11].”
• Bounds for the distance energy of a graph (2008, unknown): “For more results on E(G) see [1,2,4,10–13,16,17,19–25,27–35,37].”