Permanental roots and the star degree of a graph
From MaRDI portal
Publication:802573
DOI10.1016/0024-3795(85)90281-2zbMath0559.05041OpenAlexW2040603850MaRDI QIDQ802573
Publication date: 1985
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(85)90281-2
Related Items
Graph reduction techniques and the multiplicity of the Laplacian eigenvalues ⋮ Graph Laplacians, nodal domains, and hyperplane arrangements ⋮ On the multiplicity of −1 as an eigenvalue of a tree with given number of pendant vertices ⋮ Graphs determined by the (signless) Laplacian permanental polynomials ⋮ Further results on the star degree of graphs ⋮ On the multiplicity of Laplacian eigenvalues and Fiedler partitions ⋮ Multiplicity of integer roots of polynomials of graphs ⋮ Edge perturbation on graphs with clusters: adjacency, Laplacian and signless Laplacian eigenvalues ⋮ The Second Immanantal Polynomial and the Centroid of a Graph ⋮ Leaders in multi-agent controllability under consensus algorithm and tree topology ⋮ On the multiplicity of Laplacian eigenvalues for unicyclic graphs ⋮ Signless Laplacians of finite graphs ⋮ On the distribution of Laplacian eigenvalues of trees ⋮ The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs ⋮ The bipartite Laplacian matrix of a nonsingular tree ⋮ Classification of trees by Laplacian eigenvalue distribution and edge covering number ⋮ On a conjecture of Laplacian energy of trees ⋮ On the Laplacian spectrum of \(k\)-symmetric graphs ⋮ On the roots of (signless) Laplacian permanental polynomials of graphs ⋮ A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials ⋮ Classification of graphs by Laplacian eigenvalue distribution and independence number ⋮ Line graphs of trees with the largest eigenvalue multiplicity ⋮ Laplacian energy of diameter 3 trees ⋮ Localization in Matrix Computations: Theory and Applications ⋮ On the Laplacian and signless Laplacian spectrum of a graph with \(k\) pairwise co-neighbor vertices ⋮ On the distribution of Laplacian eigenvalues of a graph ⋮ On the geometry and Laplacian of a graph ⋮ Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution ⋮ Computing the permanental polynomials of graphs ⋮ Ordering trees by algebraic connectivity ⋮ Domination number and Laplacian eigenvalue of trees ⋮ On the multiplicity of \(\alpha\) as an eigenvalue of \(A_\alpha(G)\) of graphs with pendant vertices ⋮ The ordering of trees and connected graphs by algebraic connectivity ⋮ On the (signless) Laplacian permanental polynomials of graphs ⋮ A relation between the matching number and Laplacian spectrum of a graph ⋮ On the Faria's inequality for the Laplacian and signless Laplacian spectra: a unified approach ⋮ On the eigenvalue two and matching number of a tree ⋮ Unnamed Item ⋮ A minimax-condition for the characteristic center of a tree ⋮ Trees with a large Laplacian eigenvalue multiplicity ⋮ On the multiplicity of laplacian eigenvalues of graphs ⋮ Proof of a conjecture on `plateaux' phenomenon of graph Laplacian eigenvalues ⋮ A note on Merris' conjectures ⋮ The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs ⋮ Generalized permanental polynomials of graphs ⋮ Developments in the theory of graph spectra ⋮ On the multiplicity of \(\alpha\) as an \(A_\alpha(\varGamma)\)-eigenvalue of signed graphs with pendant vertices ⋮ Characteristic vertices of trees* ⋮ Characteristic vertices of trees* ⋮ Edge perturbation on signed graphs with clusters: adjacency and Laplacian eigenvalues ⋮ On the normalized Laplacian permanental polynomial of a graph ⋮ The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices ⋮ A discrete nodal domain theorem for trees ⋮ Tree simplification and the `plateaux' phenomenon of graph Laplacian eigenvalues ⋮ Laplacian matrices of graphs: A survey
Cites Work
