Per-spectral characterizations of graphs with extremal per-nullity
From MaRDI portal
Publication:491098
DOI10.1016/j.laa.2015.06.018zbMath1327.05162OpenAlexW833973862MaRDI QIDQ491098
Publication date: 24 August 2015
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2015.06.018
Graph polynomials (05C31) Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (11)
Graphs determined by the (signless) Laplacian permanental polynomials ⋮ Per-spectral characterizations of some bipartite graphs ⋮ A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials ⋮ Permanents of almost regular complete bipartite graphs ⋮ Computing the permanental polynomials of graphs ⋮ Per-spectral characterizations of bicyclic networks ⋮ Constructing graphs which are permanental cospectral and adjacency cospectral ⋮ On the permanental nullity and matching number of graphs ⋮ Generalized permanental polynomials of graphs ⋮ On the normalized Laplacian permanental polynomial of a graph ⋮ Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A characterization of graphs with rank 5
- Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
- The complexity of computing the permanent
- A characterization of graphs with rank 4
- Developments on spectral characterizations of graphs
- Matching theory
- Permanental polynomials of graphs
- Which graphs are determined by their spectrum?
- On the permanental polynomials of some graphs
- On the characterizing properties of the permanental polynomials of graphs
- A note on the permanental roots of bipartite graphs
- Per-spectral characterizations of some edge-deleted subgraphs of a complete graph
- On the nullity of graphs
- Paths, Trees, and Flowers
- Characterizing properties of permanental polynomials of lollipop graphs
- Cospectral Graphs and Digraphs
This page was built for publication: Per-spectral characterizations of graphs with extremal per-nullity