Cayley graphs on the symmetric group generated by initial reversals have unit spectral gap.
Cesi, Filippo (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cesi, Filippo (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Renteln, Paul (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ku, Cheng Yeaw, Wong, Tony W.H. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ramaswamy, H.N., Veena, C.R. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sander, Torsten (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Xiaoxia Fan, Yanfeng Luo, Xing Gao (2013)
Open Mathematics
Similarity:
An eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. Let G 0 be the graph obtained from G by deleting all pendant vertices and δ(G) the minimum degree of vertices of G. In this paper, all connected tricyclic graphs G with δ(G 0) ≥ 2 and exactly two main eigenvalues are determined.
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...
Grone, Robert, Merris, Russell (1988)
Portugaliae mathematica
Similarity:
Clemens Brand, Norbert Seifter (1996)
Mathematica Slovaca
Similarity: