On the characterizing properties of the permanental polynomials of graphs
From MaRDI portal
Publication:1932591
DOI10.1016/j.laa.2012.08.026zbMath1257.05069OpenAlexW2023201733MaRDI QIDQ1932591
Publication date: 21 January 2013
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2012.08.026
Related Items (18)
On the bivariate permanent polynomials of graphs ⋮ Graphs determined by the (signless) Laplacian permanental polynomials ⋮ Per-spectral characterizations of some edge-deleted subgraphs of a complete graph ⋮ 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 graphs with extremal per-nullity ⋮ Per-spectral characterizations of bicyclic networks ⋮ Constructing graphs which are permanental cospectral and adjacency cospectral ⋮ On the (signless) Laplacian permanental polynomials of graphs ⋮ On the permanental nullity and matching number of graphs ⋮ Highly unique network descriptors based on the roots of the permanental polynomial ⋮ Generalized permanental polynomials of graphs ⋮ Characterizing properties of permanental polynomials of lollipop graphs ⋮ On the normalized Laplacian permanental polynomial of a graph ⋮ On the permanental sum of graphs ⋮ 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
- The complexity of computing the permanent
- Matching theory
- Permanental polynomials of graphs
- On matching coefficients
- Problems in algebraic combinatorics
- Which graphs are determined by their spectrum?
- On the permanental polynomials of some graphs
- Generalized Matrix Functions and the Graph Isomorphism Problem
- Cospectral Graphs and Digraphs
This page was built for publication: On the characterizing properties of the permanental polynomials of graphs
