Properties of $\theta$-super positive graphs

TL;DR

This paper explores the structure of $ heta$-super positive graphs, generalizing known properties of 0-super positive graphs, and introduces new classifications and construction methods for these graphs.

Contribution

It characterizes $ heta$-super positive graphs for non-zero $ heta$, introduces $ heta$-elementary and $ heta$-base graphs, and provides a construction and characterization framework.

Findings

$ heta$-super positive graphs with $ heta eq 0$ contain cycles.

Any $ heta$-super positive graph can be constructed from $ heta$-base graphs.

Characterization of $ heta$-elementary graphs via $ heta$-barrier sets.

Abstract

Let the matching polynomial of a graph $G$ be denoted by $\mu (G,x)$. A graph $G$ is said to be $\theta$-super positive if $\mu(G,\theta)\neq 0$ and $\mu(G\setminus v,\theta)=0$ for all $v\in V(G)$. In particular, $G$ is 0-super positive if and only if $G$ has a perfect matching. While much is known about 0-super positive graphs, almost nothing is known about $\theta$-super positive graphs for $\theta \not = 0$. This motivates us to investigate the structure of $\theta$-super positive graphs in this paper. Though a 0-super positive graph may not contain any cycle, we show that a $\theta$-super positive graph with $\theta \not = 0$ must contain a cycle. We introduce two important types of $\theta$-super positive graphs, namely $\theta$-elementary and $\theta$-base graphs. One of our main results is that any $\theta$-super positive graph $G$ can be constructed by adding certain type of edges to a disjoint union of $\theta$-base graphs; moreover, these $\theta$-base graphs are uniquely determined by $G$. We also give a characterization of $\theta$-elementary graphs: a graph $G$ is $\theta$-elementary if and only if the set of all its $\theta$-barrier sets form a partition of $V(G)$. Here, $\theta$-elementary graphs and $\theta$-barrier sets can be regarded as $\theta$-analogue of elementary graphs and Tutte sets in classical matching theory.