On the matching and permanental polynomials of graphs

DOI10.1016/j.dam.2021.05.030zbMath1469.05084OpenAlexW3169121662MaRDI QIDQ2043349

Wei Li

Publication date: 2 August 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.05.030

zbMATH Keywords

perfect matchingmatching polynomialpermanental polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matrices of integers (15B36)

Related Items (1)

Perfect matching complexes of honeycomb graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• On the skew-permanental polynomials of orientation graphs
• Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
• Matching theory
• Permanental polynomials of graphs
• The graphs whose permanental polynomials are symmetric
• Extremal hexagonal chains with respect to the coefficients sum of the permanental polynomial
• On the permanental polynomials of some graphs
• Unicyclic graphs with second largest and second smallest permanental sums
• The extremal permanental sum for a quasi-tree graph
• A note on the permanental roots of bipartite graphs
• Per-spectral characterizations of some edge-deleted subgraphs of a complete graph
• Generalized Matrix Functions and the Graph Isomorphism Problem

This page was built for publication: On the matching and permanental polynomials of graphs