More on the sixth coefficient of the matching polynomial in regular graphs

Neda Soltani; Saeid Alikhani

More on the sixth coefficient of the matching polynomial in regular graphs

Combinatorics 2017-10-23 v1

Authors: Neda Soltani , Saeid Alikhani

Abstract

A matching set $M$ in a graph $G$ is a collection of edges of $G$ such that no two edges from $M$ share a vertex. In this paper we consider some parameters related to the matching of regular graphs. We find the sixth coefficient of the matching polynomial of regular graphs. As a consequence, every cubic graph of order $10$ is matching unique.

Keywords

matching polynomial regular graphs cubic graphs matching unique graph coefficients combinatorics

Cite

@article{arxiv.1710.07426,
  title  = {More on the sixth coefficient of the matching polynomial in regular graphs},
  author = {Neda Soltani and Saeid Alikhani},
  journal= {arXiv preprint arXiv:1710.07426},
  year   = {2017}
}

Comments

11 pages, 5 figures

Related papers

View all related →