Graphs with few matching roots

DOI10.1007/s00373-012-1186-7zbMath1272.05081arXiv1011.0284MaRDI QIDQ367053

Ebrahim Ghorbani

Publication date: 26 September 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

matching polynomial; friendship graph; comatching graphs; matching unique graph

Mathematics Subject Classification ID

05C31: Graph polynomials

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

Related Items

TOTAL DOMINATION POLYNOMIAL OF GRAPHS FROM PRIMARY SUBGRAPHS, THE MULTIPLICITY OF ZERO ROOTS OF MATCHING POLYNOMIAL OF A GRAPH, Graphs whose certain polynomials have few distinct roots, Further results on the largest matching root of unicyclic graphs, Lower bounds on matching energy of graphs, On matching integral graphs, Extremal matching energy and the largest matching root of complete multipartite graphs, Graphs with six distinct matching roots

Cites Work

• Unnamed Item
• Spectra of graphs
• An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial
• Multiplicative cones - a family of three eigenvalue graphs
• Nonregular graphs with three eigenvalues
• The matching polynomial of a regular graph
• Graphs with constant \(\mu\) and \(\overline{\mu}\)
• On graphs with three eigenvalues
• Small regular graphs with four eigenvalues
• Algebraic matching theory
• Graphs determined by polynomial invariants
• On characterizing certain graphs with four eigenvalues by their spectra
• Theory of monomer-dimer systems
• A note on graphs whose signless Laplacian has three distinct eigenvalues
• On the theory of the matching polynomial
• GRAPHS WITH A SMALL NUMBER OF DISTINCT EIGENVALUES