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

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.

11 pages, 5 figures

References in corpus (1)

• Sandwiching saturation number of fullerene graphs