Permanental roots and the star degree of a graph
From MaRDI portal
Publication:802573
DOI10.1016/0024-3795(85)90281-2zbMATH Open0559.05041OpenAlexW2040603850MaRDI QIDQ802573FDOQ802573
Authors: Isabel Faria 
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
Recommendations
Cites Work
- Permanental polynomials of graphs
- Title not available (Why is that?)
- Generalized Matrix Functions and the Graph Isomorphism Problem
- Title not available (Why is that?)
- Parallel concepts in graph theory
- Permanents
- The Laplacian permanental polynomial for trees
- Permanent of the Laplacian matrix of trees and bipartite graphs
- Title not available (Why is that?)
Cited In (56)
- On the distribution of Laplacian eigenvalues of a graph
- Classification of trees by Laplacian eigenvalue distribution and edge covering number
- Edge perturbation on signed graphs with clusters: adjacency and Laplacian eigenvalues
- Characteristic vertices of trees*
- Classification of graphs by Laplacian eigenvalue distribution and independence number
- The characterizing properties of (signless) Laplacian permanental polynomials of almost complete graphs
- The ordering of trees and connected graphs by algebraic connectivity
- A discrete nodal domain theorem for trees
- Localization in matrix computations: theory and applications
- Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution
- On the multiplicity of \(-1\) as an eigenvalue of a tree with given number of pendant vertices
- Computing the permanental polynomials of graphs
- On the (signless) Laplacian permanental polynomials of graphs
- The Second Immanantal Polynomial and the Centroid of a Graph
- Characteristic vertices of trees*
- On the eigenvalue two and matching number of a tree
- On the multiplicity of the adjacency eigenvalues of graphs
- The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs
- Leaders in multi-agent controllability under consensus algorithm and tree topology
- On the multiplicity of \(\alpha\) as an eigenvalue of \(A_\alpha(G)\) of graphs with pendant vertices
- Laplacian matrices of graphs: A survey
- A relation between the matching number and Laplacian spectrum of a graph
- On the multiplicity of \(\alpha\) as an \(A_\alpha(\varGamma)\)-eigenvalue of signed graphs with pendant vertices
- Unicyclic graphs with five Laplacian eigenvalues different from 0 and 1
- The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
- Further results on the star degree of graphs
- On the distribution of Laplacian eigenvalues of trees
- Line graphs of trees with the largest eigenvalue multiplicity
- Graphs determined by the (signless) Laplacian permanental polynomials
- On the Faria's inequality for the Laplacian and signless Laplacian spectra: a unified approach
- Proof of a conjecture on `plateaux' phenomenon of graph Laplacian eigenvalues
- On the multiplicity of Laplacian eigenvalues and Fiedler partitions
- On a conjecture of Laplacian energy of trees
- Domination number and Laplacian eigenvalue of trees
- Trees with a large Laplacian eigenvalue multiplicity
- On the geometry and Laplacian of a graph
- Edge perturbation on graphs with clusters: adjacency, Laplacian and signless Laplacian eigenvalues
- Multiplicity of integer roots of polynomials of graphs
- On the Laplacian and signless Laplacian spectrum of a graph with \(k\) pairwise co-neighbor vertices
- Graph Laplacians, nodal domains, and hyperplane arrangements
- Ordering trees by algebraic connectivity
- Tree simplification and the `plateaux' phenomenon of graph Laplacian eigenvalues
- Generalized permanental polynomials of graphs
- On the normalized Laplacian permanental polynomial of a graph
- The bipartite Laplacian matrix of a nonsingular tree
- A note on Merris' conjectures
- Developments in the theory of graph spectra
- Signless Laplacians of finite graphs
- Laplacian energy of diameter 3 trees
- On the roots of (signless) Laplacian permanental polynomials of graphs
- A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials
- On the multiplicity of laplacian eigenvalues of graphs
- A minimax-condition for the characteristic center of a tree
- On the multiplicity of Laplacian eigenvalues for unicyclic graphs
- Some unicyclic graphs determined by the signless Laplacian permanental polynomial
- On the Laplacian spectrum of \(k\)-symmetric graphs
This page was built for publication: Permanental roots and the star degree of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q802573)
