Generalized $D$-graphs for Nonzero Roots of the Matching Polynomial

Abstract

Recently, Bauer et al. (J Graph Theory 55(4) (2007), 343--358) introduced a graph operator $D(G)$, called the $D$-graph of $G$, which has been useful in investigating the structural aspects of maximal Tutte sets in $G$ with a perfect matching. Among other results, they proved a characterization of maximal Tutte sets in terms of maximal independent sets in the graph $D(G)$ and maximal extreme sets in $G$. This was later extended to graphs without perfect matchings by Busch et al. (Discrete Appl. Math. 155 (2007), 2487--2495). Let $θ$ be a real number and $μ(G,x)$ be the matching polynomial of a graph $G$. Let $\textnormal{mult} (θ, G)$ be the multiplicity of $θ$ as a root of $μ(G,x)$. We observe that the notion of $D$-graph is implicitly related to $θ=0$. In this paper, we give a natural generalization of the $D$-graph of $G$ for any real number $θ$, and denote this new operator by $D_θ(G)$, so that $D_θ(G)$ coincides with $D(G)$ when $θ=0$. We prove a characterization of maximal $θ$-Tutte sets which are $θ$-analogue of maximal Tutte sets in $G$. In particular, we show that for any $X \subseteq V(G)$, $|X|>1$, and any real number $θ$, $\m(θ, G \setminus X)=\m(θ, G)+|X|$ if and only if $\m(θ, G \setminus uv)=\m(θ, G)+2$ for any $u, v \in X$, $u \not = v$, thus extending the preceding work of Bauer et al. and Busch et al. which established the result for the case $θ=0$.