论文信息 - Graph energy change due to edge deletion

Graph energy change due to edge deletion

The energy of a graph is the sum of the singular values of its adjacency matrix. We are interested in how the energy of a graph changes when edges are deleted. Examples show that all cases are possible: increased, decreased, unchanged. Our goal is to find possible graph theoretical descriptions and to provide an infinite family of graphs for each case. The main tool is a singular value inequality for complementary submatrices and its equality case.

Wasin So | Jane M. Day

[1] R. Balakrishnan. The energy of a graph , 2004 .

[2] I. Gutman. The Energy of a Graph: Old and New Results , 2001 .

[3] Wasin So,et al. SINGULAR VALUE INEQUALITY AND GRAPH ENERGY CHANGE , 2007 .

[4] Irene Sciriha,et al. Spectra of families of matrices described by graphs, digraphs, and sign patterns , 2006 .

[5] V. Nikiforov. The energy of graphs and matrices , 2006, math/0603583.

[6] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[7] Ivan Gutman,et al. Acyclic systems with extremal Hückel π-electron energy , 1977 .

[8] R. C. Thompson,et al. Singular value inequalities for matrix sums and minors , 1975 .

[9] Anton Betten,et al. Algebraic Combinatorics and Applications : Proceedings , 2001 .