Constructing graphs with energy ?E(G) where G is a bipartite graph
Abstract
The energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of its adjacency matrix. If G is a bipartite graph and r is any positive integer, we construct graphs with energy ?E(G).
Más información
Título de la Revista: | MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY |
Volumen: | 62 |
Número: | 3 |
Editorial: | UNIV KRAGUJEVAC, FAC SCIENCE |
Fecha de publicación: | 2009 |
Página de inicio: | 465 |
Página final: | 472 |
URL: | http://www.scopus.com/inward/record.url?eid=2-s2.0-77949395610&partnerID=q2rCbXpz |