Constructing graphs which are permanental cospectral and adjacency cospectral
From MaRDI portal
Publication:1756130
DOI10.1007/s00373-018-1963-zzbMath1402.05143OpenAlexW2896501955WikidataQ129091571 ScholiaQ129091571MaRDI QIDQ1756130
Publication date: 11 January 2019
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-018-1963-z
Graph polynomials (05C31) Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph operations (line graphs, products, etc.) (05C76)
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
- An efficient algorithm for computing permanental polynomials of graphs
- Matching theory
- Permanental polynomials of graphs
- Two problems involving Schur functions
- On the permanental polynomials of some graphs
- On the characterizing properties of the permanental polynomials of graphs
- Per-spectral characterizations of some bipartite graphs
- A note on the permanental roots of bipartite graphs
- Eigenschaften der Permanentefunktion
- Graph Polynomials
- Per-spectral characterizations of some edge-deleted subgraphs of a complete graph
- On the permanental nullity and matching number of graphs
- Characterizing properties of permanental polynomials of lollipop graphs
- Generalized Matrix Functions and the Graph Isomorphism Problem
- On the Multiplicative Inverse Eigenvalue Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Constructing graphs which are permanental cospectral and adjacency cospectral
