The graphs whose permanental polynomials are symmetric

DOI10.7151/dmgt.1986zbMath1377.05090OpenAlexW2623414558MaRDI QIDQ1692645

Wei Li

Publication date: 10 January 2018

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1986

zbMATH Keywords

matchingpermanental polynomialrooted product

Mathematics Subject Classification ID

Graph polynomials (05C31) Symmetric functions and generalizations (05E05) Structural characterization of families of graphs (05C75)

Related Items (2)

Enumeration of permanental sums of lattice graphs ⋮ On the matching and permanental polynomials of graphs

Cites Work

• Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
• Graphs whose characteristic and permanental polynomials have coefficients of the same magnitude
• Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
• On the permanental polynomials of matrices
• Matching theory
• Permanental polynomials of graphs
• On the permanental polynomials of some graphs
• A note on the permanental roots of bipartite graphs
• Graph Polynomials
• Per-spectral characterizations of some edge-deleted subgraphs of a complete graph
• Generalized Matrix Functions and the Graph Isomorphism Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The graphs whose permanental polynomials are symmetric