On the permanental nullity and matching number of graphs

DOI10.1080/03081087.2017.1302403zbMath1427.05114arXiv1603.03109OpenAlexW2963183334MaRDI QIDQ5206292

Hong-Jian Lai, Tingzeng Wu

Publication date: 18 December 2019

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.03109

zbMATH Keywords

matching numberpermanental polynomialpermanental nullity

Mathematics Subject Classification ID

Graph polynomials (05C31) Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (12)

On the Permanental Polynomial and Permanental Sum of Signed Graphs ⋮ On the permanental sum of bicyclic graphs ⋮ On the roots of (signless) Laplacian permanental polynomials of graphs ⋮ The extremal permanental sum for a quasi-tree graph ⋮ Constructing graphs which are permanental cospectral and adjacency cospectral ⋮ The coefficients of the immanantal polynomial ⋮ Unicyclic graphs with second largest and second smallest permanental sums ⋮ Some extremal graphs with respect to permanental sum ⋮ Permanental sums of graphs of extreme sizes ⋮ Enumeration of permanental sums of lattice graphs ⋮ Sharp bounds on the permanental sum of a graph ⋮ On the normalized Laplacian permanental polynomial of a graph

Cites Work

• Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
• Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
• Per-spectral characterizations of graphs with extremal per-nullity
• The complexity of computing the permanent
• An efficient algorithm for computing permanental polynomials of graphs
• Permanental polynomials of graphs
• Two problems involving Schur functions
• On the permanental polynomials of some graphs
• On the characterizing properties of the permanental polynomials of graphs
• A note on the permanental roots of bipartite graphs
• Eigenschaften der Permanentefunktion
• Per-spectral characterizations of some edge-deleted subgraphs of a complete graph
• Graph Factors and Matching Extensions
• Characterizing properties of permanental polynomials of lollipop graphs
• Generalized Matrix Functions and the Graph Isomorphism Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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