Spectra and Graph Comparison
Charles Delorme (2011)
Publications de l'Institut Mathématique
Similarity:
Charles Delorme (2011)
Publications de l'Institut Mathématique
Similarity:
Miroslav Fiedler (1973)
Czechoslovak Mathematical Journal
Similarity:
Grone, Robert, Merris, Russell (1988)
Portugaliae mathematica
Similarity:
Bo Zhou (2004)
Discussiones Mathematicae Graph Theory
Similarity:
If a graph is connected then the largest eigenvalue (i.e., index) generally changes (decreases or increases) if some local modifications are performed. In this paper two types of modifications are considered: (i) for a fixed vertex, t edges incident with it are deleted, while s new edges incident with it are inserted; (ii) for two non-adjacent vertices, t edges incident with one vertex are deleted, while s new edges incident with the other vertex are...
Pati, Sukanta (2001)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Clemens Brand, Norbert Seifter (1996)
Mathematica Slovaca
Similarity:
Kinkar Ch. Das (2005)
Kragujevac Journal of Mathematics
Similarity:
Kirkland, Steve (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Mustapha Aouchiche, Pierre Hansen (2014)
Czechoslovak Mathematical Journal
Similarity:
The distance Laplacian of a connected graph is defined by , where is the distance matrix of , and is the diagonal matrix whose main entries are the vertex transmissions in . The spectrum of is called the distance Laplacian spectrum of . In the present paper, we investigate some particular distance Laplacian eigenvalues. Among other results, we show that the complete graph is the unique graph with only two distinct distance Laplacian eigenvalues. We establish some properties...
Kirkland, Steve (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity: