# SINGULAR VALUE INEQUALITY AND GRAPH ENERGY CHANGE

```@article{Day2007SINGULARVI,
title={SINGULAR VALUE INEQUALITY AND GRAPH ENERGY CHANGE},
author={J. M. Day and Wasin So},
journal={Electronic Journal of Linear Algebra},
year={2007},
volume={16},
pages={25}
}```
• Published 2007
• Mathematics
• Electronic Journal of Linear Algebra
The energy of a graph is the sum of the singular values of its adjacency matrix. A classic inequality for singular values of a matrixsum, including its equality case, is used to study how the energy of a graph changes when edges are removed. One sharp bound and one bound that is never sharp, for the change in graph energy when the edges of a nonsingular induced subgraph are removed, are established. A graph is nonsingular if its adjacency matrixis nonsingular. 1. Singular value inequality for…
54 Citations

### ELA ON THE ENERGY OF SINGULAR GRAPHS

The nullity, η(G), of a graph G is the algebraic multiplicity of the eigenvalue zero in the graph’s spectrum. If η(G) > 0, then the graph G is said to be singular. The energy of a graph, E(G), was

### ON THE ENERGY OF SINGULAR GRAPHS

The nullity, �(G), of a graph G is the algebraic multiplicity of the eigenvalue zero in the graph's spectrum. If �(G) > 0, then the graph G is said to be singular. The energy of a graph, E(G), was

### THE NORMALIZED LAPLACIAN MATRIX AND GENERAL RANDI C INDEX OF GRAPHS

To any graph we may associate a matrix which records information about its structure. The goal of spectral graph theory is to see how the eigenvalues of such a matrix representation relate to the

### Applications of a theorem by Ky Fan in the theory of weighted Laplacian graph energy

• Mathematics
• 2016
The energy of a graph \$G\$ is equal to the sum of the absolute values of the eigenvalues of \$G\$ , which in turn is equal to the sum of the singular values of the adjacency matrix of \$G\$. Let \$X\$, \$Y\$

### Applications of a theorem by Ky Fan in the theory of Laplacian energy of graphs

• Mathematics
• 2009
The Laplacian energy of a graph G is equal to the sum of distances of the Laplacian eigenvalues to their average, which in turn is equal to the sum of singular values of a shift of Laplacian matrix

## References

SHOWING 1-10 OF 14 REFERENCES

### Convex and concave functions of singular values of matrix sums.

when / is an increasing concave function of a nonnegative real variable, with /(0) = 0. This inequality is of some interest as in previously published work a convexity (rather than concavity)

### Some metric inequalities in the space of matrices

• Mathematics
• 1955
In developing the matricial statements corresponding to (a), (b), (c), we must replace the modulus of a complex number by a suitably chosen norm for matrices. Let Mn denote the linear space of all

### Matrix analysis

• Mathematics
Statistical Inference for Engineers and Data Scientists
• 2018
This new edition of the acclaimed text presents results of both classic and recent matrix analyses using canonical forms as a unifying theme, and demonstrates their importance in a variety of applications.

### Singular values of matrix exponentials

• Mathematics
• 2000
The singular values of a matrix and those of its exponential are related via multiplicative majorization. Matrices giving some equalities in the majorization are characterized. As an application, a

### The case of equality in the matrix-valued triangle inequality.

This paper presents an analysis of the case of equality in the matrix-valued triangle inequality. There is complete analogy with the case of equality in the usual scalar triangle inequality.

### Singular Values, Diagonal Elements, and Convexity

Necessary and sufficient conditions are given for the existence of a matrix with prescribed singular values and prescribed elements in its main diagonal. Numerous related results are also given.