On the spectrum and energy of singular graphs
Energy of a graph is defined as the sum of the absolute values of the eigenvalues of the adjacency matrix A(G)of a graph Gand is denoted by E(G). The graph G with n vertices is called nonhypoenergetic if E(G)≥nand hypoenergetic if E(G)<n. Singular graphs are graphs with nullity η(G)>0. In this...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2019-12-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S0972860016301608 |