On the bivariate permanent polynomials of graphs
From MaRDI portal
Publication:2361557
DOI10.1016/j.laa.2017.04.021zbMath1365.05139OpenAlexW2608827300MaRDI QIDQ2361557
Publication date: 30 June 2017
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2017.04.021
Graph polynomials (05C31) Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (2)
Some extremal graphs with respect to permanental sum ⋮ Generalized permanental polynomials of graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
- The complexity of computing the permanent
- Matching theory
- Permanental polynomials of graphs
- Graph characterising polynomials
- Problems in algebraic combinatorics
- Farrell polynomials on graphs of bounded tree width
- Graphs determined by polynomial invariants
- On the characterizing properties of the permanental polynomials of graphs
- Practical graph isomorphism. II.
- Tutte uniqueness of line graphs
- 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: On the bivariate permanent polynomials of graphs