๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Edge addition, singular values, and energy of graphs and matrices

โœ Scribed by Saieed Akbari; Ebrahim Ghorbani; Mohammad Reza Oboudi


Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
135 KB
Volume
430
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

โœฆ Synopsis


The energy of a graph/matrix is the sum of the absolute values of its eigenvalues. We investigate the result of duplicating/removing an edge to the energy of a graph. We also deal with the problem that which graphs G have the property that if the edges of G are covered by some subgraphs, then the energy of G does not exceed the sum of the subgraphs' energies. The problems are addressed in the general setting of energy of matrices which leads us to consider the singular values too. Among the other results it is shown that the energy of a complete multipartite graph increases if a new edge added or an old edge is deleted.


๐Ÿ“œ SIMILAR VOLUMES


On the sum of k largest singular values
โœ Vladimir Nikiforov ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 164 KB

In the recent years, the trace norm of graphs has been extensively studied under the name of graph energy. The trace norm is just one of the Ky Fan k-norms, given by the sum of the k largest singular values, which are studied more generally in the present paper. Several relations to chromatic number

The undirected graph and estimates of ma
โœ Luoluo Li ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 385 KB

With the help of the undirected graph of a matrix we establish new theorems for estimating the singular values. The location of singular values of a matrix A is described in terms of its deleted absolute row sums and column sums. The formulation has an appearance analogous to Brauer's and Brualdi's