Algebraic connectivity of graphs
Miroslav Fiedler (1973)
Czechoslovak Mathematical Journal
Similarity:
Displaying similar documents to “Kernels of directed graph Laplacians.”
Algebraic connectivity of graphs
On the first eigenvalue of bipartite graphs.
Bhattacharya, Amitava, Friedland, Shmuel, Peled, Uri N. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The number of eigenvalues greater than two in the Laplacian spectrum of a graph
Merris, Russell (1991)
Portugaliae mathematica
Similarity:
Multipartite separability of Laplacian matrices of graphs.
Wu, Chai Wah (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the energy and spectral properties of the he matrix of hexagonal systems
Faqir M. Bhatti, Kinkar Ch. Das, Syed A. Ahmed (2013)
Czechoslovak Mathematical Journal
Similarity:
The He matrix, put forward by He and He in 1989, is designed as a means for uniquely representing the structure of a hexagonal system (= benzenoid graph). Observing that the He matrix is just the adjacency matrix of a pertinently weighted inner dual of the respective hexagonal system, we establish a number of its spectral properties. Afterwards, we discuss the number of eigenvalues equal to zero of the He matrix of a hexagonal system. Moreover, we obtain a relation between the number...
A quantitative extension of the Perron-Frobenius theorem for doubly stochastic matrices
Miroslav Fiedler, Vlastimil Pták (1975)
Czechoslovak Mathematical Journal
Similarity:
Upper bound for the non-maximal eigenvalues of irreducible nonnegative matrices
Xiao-Dong Zhang, Rong Luo (2002)
Czechoslovak Mathematical Journal
Similarity:
We present a lower and an upper bound for the second smallest eigenvalue of Laplacian matrices in terms of the averaged minimal cut of weighted graphs. This is used to obtain an upper bound for the real parts of the non-maximal eigenvalues of irreducible nonnegative matrices. The result can be applied to Markov chains.