Summary: Let G be a graph. The Laplacian matrix $L(G)=D(G)-A(G)$ is the difference of the diagonal matrix of vertex degrees and the 0-1 adjacency matrix. Various aspects of the spectrum of L(G) are investigated. Particular attention is given to multiplicities of integer eigenvalues an...
graphpacking numberLaplacian spectrumperfect subgraphlower boundFor a subgraph H of G, an H-packing of G is a set of pairwise disjoint subgraphs that are all isomorphic copies of H. An H-packing of maximum cardinality is a maximum H-packing in G denoted by H(G). The cardinality of a ...
Alon [A2] and Alon and Milman [AM1, AM2] followed Tanner’s approach, but later they realized [A1, AM3, AGM] that the Laplacian spectrum of a graph (in particular the second smallest eigenvalue) appears more naturally in the study of expanding properties of graphs. [Ro] is an overview...
The Laplacian spectrum of a graph is the eigenvalues of the associated Laplacian matrix. The quotient between the largest and second smallest Laplacian eigenvalues of a connected graph, is called the Laplacian spectral ratio. Some bounds on the Laplacian spectral ratio are considered. We improve a ...
W.: A relation between the matching number and the Laplacian spectrum of a graph. Linear Algebra Appl. , 325 , 71–74 (2001) MathSciNetJ. M. Guo, S. W. Tan : A relation between the matching number and the Laplacian spectrum of a graph. Linear Algebra Appl. 325 (2001), 71–74....
A graph is said to be determined by its signless Laplacian spectrum if there is no other non-isomorphic graph with the same spectrum. In this paper, it is ... Omidi,GR,Vatandoost,... - 《Electronic Journal of Linear Algebra》 被引量: 29发表: 2010年 ON THE LAPLACIAN SPECTRA OF PRODU...
从1965年的文献开始,罗列了许多IMs of KM。依次介绍了各个方法及其优缺点,并从复杂度角度比较了两种复杂度的算法及其应用。作为一篇导论性或综述性的文章具有一定可读性。 泛读: [1] 1997 Graph Theory, Combinatorics and Application. Bojan Mohar, THE LAPLACIAN SPECTRUM OF GRAPHS.(被精读[1]所引用) ...
We prove that if $M$ is a complete hypersurface in $\\mathbb{R}^{n+1}$ which is graph of a real radial function, then the spectrum of the Laplace operator on M is the interval $[0,\\infty)$.doi:10.2140/involve.2017.10.677de Matos, Rodrigo Bezerra...
Then the normalized Laplacian spectrum of (Formula presented.) is given in terms of that of (Formula presented.) and (Formula presented.) for any connected graph (Formula presented.) and a regular graph (Formula presented.). Finally, as applications, the number of spanning trees and the ...
Recently, in the study of the properties of a graph which are revealed by its spectrum, an upper bound for the diameter in terms of the so-called alternati... MA Fiol,E Garriga,JLA Yebra - 《Discrete Mathematics》 被引量: 71发表: 2001年 A NEW UPPER BOUND FOR THE LAPLACIAN SPECTRAL RA...