Graphs with integer matching polynomial zeros

DOI10.1016/J.DAM.2017.02.009zbMath1361.05066arXiv1608.00782OpenAlexW2478779766MaRDI QIDQ526810

A. Ghafari, Péter Csikvári, Saieed Akbari, Mina Nahvi, Somayeh Khalashi Ghezelahmad

Publication date: 15 May 2017

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

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

zbMATH Keywords

matching polynomialmatching integral

Mathematics Subject Classification ID

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

Related Items (5)

On matching integral graphs ⋮ Matching Energy of Graphs with Maximum Degree at Most 3 ⋮ On the eccentric connectivity polynomial of \(\mathcal{F}\)-sum of connected graphs ⋮ Lower bounds on matching energy of graphs ⋮ Extremal matching energy and the largest matching root of complete multipartite graphs

Cites Work

• Factors and factorizations of graphs. Proof techniques in factor theory
• A note on Hamiltonian circuits
• Theory of Monomer-Dimer Systems. Erratum
• On the theory of the matching polynomial
• 1-Factors and Antifactor Sets
• A survey on integral graphs
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graphs with integer matching polynomial zeros