Spectra of weighted compound graphs of generalized Bethe trees.
Spectra of weighted rooted graphs having prescribed subgraphs at some levels.
Spectral characterization of multicone graphs
A multicone graph is defined to be the join of a clique and a regular graph. Based on Zhou and Cho's result [B. Zhou, H. H. Cho, Remarks on spectral radius and Laplacian eigenvalues of a graph, Czech. Math. J. 55 (130) (2005), 781–790], the spectral characterization of multicone graphs is investigated. Particularly, we determine a necessary and sufficient condition for two multicone graphs to be cospectral graphs and investigate the structures of graphs cospectral to a multicone graph. Additionally,...
Spectral characterizations of dumbbell graphs.
Spectral Characterizations of Line Graphs. Variations on the Theme
Spectral extrema for graphs: the Zarankiewicz problem.
Spectral graph theory and the inverse eigenvalue problem of a graph.
Spectral integral variation of trees
In this paper, we determine all trees with the property that adding a particular edge will result in exactly two Laplacian eigenvalues increasing respectively by 1 and the other Laplacian eigenvalues remaining fixed. We also investigate a situation in which the algebraic connectivity is one of the changed eigenvalues.
Spectral radius and Hamiltonicity of graphs with large minimum degree
Let be a graph of order and the spectral radius of its adjacency matrix. We extend some recent results on sufficient conditions for Hamiltonian paths and cycles in . One of the main results of the paper is the following theorem: Let
Spectral Recognition of Graphs
Spectral saturation: inverting the spectral Turán theorem.
Spectral study of alliances in graphs
In this paper we obtain several tight bounds on different types of alliance numbers of a graph, namely (global) defensive alliance number, global offensive alliance number and global dual alliance number. In particular, we investigate the relationship between the alliance numbers of a graph and its algebraic connectivity, its spectral radius, and its Laplacian spectral radius.
Spectral Techniques in Complex Networks
Spectrally arbitrary tree sign patterns of order 4.
Spectrum of two new joins of graphs and infinite families of integral graphs
Star Complements and Maximal Exceptional Graphs
Starlike trees with maximum degree 4 are determined by their signless Laplacian spectra.
Strongly regular graphs: Values of and for which there are only finitely many feasible .
Structures ofW(2.2) Lie conformal algebra
The purpose of this paper is to study W(2, 2) Lie conformal algebra, which has a free ℂ[∂]-basis L, M such that [...] [LλL]=(∂+2λ)L,[LλM]=(∂+2λ)M,[MλM]=0 . In this paper, we study conformal derivations, central extensions and conformal modules for this Lie conformal algebra. Also, we compute the cohomology of this Lie conformal algebra with coefficients in its modules. In particular, we determine its cohomology with trivial coefficients both for the basic and reduced complexes.
Subdominant eigenvalues for stochastic matrices with given column sums.