Skip to main navigation Skip to Content
Paper IPM / M / 9498  


Abstract:  
The energy of a graph E(G), is the sum of the singular values of its adjacency matrix. We define incidence energy of the graph G, denoted by IE(G), as the sum of the singular values of its incidence matrix. We are interested to find the relation between the energy and the incidence energy of graphs. For any graph G we obtain a bipartite graph ∧G such that
IE(G) = [(E(∧G))/2] . Moreover we ?nd some similar upper and lower bounds of energy
for incidence energy. Finally we show that for any proper subgraph H of the graph G, IE(G) > IE(H).
Download TeX format 

back to top 
COPYRIGHT 2012 © ALL RIGHTS RESERVED
Please submit your comments or questions here, or contact Webmaster  ipmic@ipm.ir