The signless Laplacian spectral radius of graphs with given number of cut vertices
In this paper, we determine the graph with maximal signless Laplacian spectral radius among all connected graphs with fixed order and given number of cut vertices.
The (signless) Laplacian spectral radius of unicyclic and bicyclic graphs with vertices and pendant vertices
In this paper, the effects on the signless Laplacian spectral radius of a graph are studied when some operations, such as edge moving, edge subdividing, are applied to the graph. Moreover, the largest signless Laplacian spectral radius among the all unicyclic graphs with vertices and pendant vertices is identified. Furthermore, we determine the graphs with the largest Laplacian spectral radii among the all unicyclic graphs and bicyclic graphs with vertices and pendant vertices, respectively....
The singularity/nonsingularity problem for matrices satisfying diagonal dominance conditions formulated in terms of directed graphs.
The spectral determinations of the connected multicone graphs and
Finding and discovering any class of graphs which are determined by their spectra is always an important and interesting problem in the spectral graph theory. The main aim of this study is to characterize two classes of multicone graphs which are determined by both their adjacency and Laplacian spectra. A multicone graph is defined to be the join of a clique and a regular graph. Let denote a complete graph on vertices, and let be a positive integer number. In A. Z. Abdian (2016) it has been...
The spectral excess theorem for distance-regular graphs: a global (over)view.
The spectral gap of random graphs with given expected degrees.
The spectral method for detrmining the number of trees.
The spectral radius and the maximum degree of irregular graphs.
The spectral radius of subgraphs of regular graphs.
The Spectrum Of Infinite Complite Multipartite Graphs
The Spectrum Of Line Graphs Of Some Infinite Graphs
The spectrum of neighborhood corona of graphs
The spectrum of the edge corona of two graphs.
The star is the tree with greatest greatest Laplacian eigenvalue
The Strongly Asymmetric Graphs of Order 6 and 7
The Sun graph is determined by its signless Laplacian spectrum.
The third smallest eigenvalue of the Laplacian matrix.
The tripartite separability of density matrices of graphs.
The (weakly) sign symmetric -matrix completion problems.
Théorèmes de Courant et de Cheng combinatoires