Per-spectral characterizations of some bipartite graphs
From MaRDI portal
Publication:2409785
DOI10.7151/dmgt.1981zbMath1372.05104OpenAlexW2613390224MaRDI QIDQ2409785
Publication date: 13 October 2017
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1981
Graph polynomials (05C31) Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (4)
Permanents of almost regular complete bipartite graphs ⋮ Per-spectral characterizations of bicyclic networks ⋮ Sharp upper bounds of $A_\alpha$-spectral radius of cacti with given pendant vertices ⋮ Constructing graphs which are permanental cospectral and adjacency cospectral
Cites Work
- Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
- Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
- Per-spectral characterizations of graphs with extremal per-nullity
- The complexity of computing the permanent
- Developments on spectral characterizations of graphs
- Permanental polynomials of graphs
- On matching coefficients
- 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
- Characterizing properties of permanental polynomials of lollipop graphs
- Cospectral Graphs and Digraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Per-spectral characterizations of some bipartite graphs