Generalized permanental polynomials of graphs
From MaRDI portal
Publication:2311039
DOI10.3390/sym11020242zbMath1416.05148OpenAlexW2911656451MaRDI QIDQ2311039
Publication date: 10 July 2019
Published in: Symmetry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/sym11020242
Related Items (2)
Measuring similarity between connected graphs: the role of induced subgraphs and complementarity eigenvalues ⋮ Polynomial invariants for cactuses
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- nauty
- Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
- Per-spectral characterizations of graphs with extremal per-nullity
- The complexity of computing the permanent
- Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix
- Permanental roots and the star degree of a graph
- Cospectral graphs and the generalized adjacency matrix
- A computational approach to construct a multivariate complete graph invariant
- Permanental polynomials of graphs
- Graph characterising polynomials
- Graphs determined by polynomial invariants
- On the characterizing properties of the permanental polynomials of graphs
- Graph measures with high discrimination power revisited: a random polynomial approach
- Highly unique network descriptors based on the roots of the permanental polynomial
- On the bivariate permanent polynomials of graphs
- Practical graph isomorphism. II.
- Graph Polynomials
- Per-spectral characterizations of some edge-deleted subgraphs of a complete graph
- Characterizing properties of permanental polynomials of lollipop graphs
This page was built for publication: Generalized permanental polynomials of graphs