• Corpus ID: 119651273

Construction and characterization of graphs whose each spanning tree has a perfect matching

@article{Wu2016ConstructionAC,
  title={Construction and characterization of graphs whose each spanning tree has a perfect matching},
  author={Baoyindureng Wu and Heping Zhang},
  journal={arXiv: Combinatorics},
  year={2016}
}
An edge subset $S$ of a connected graph $G$ is called an anti-Kekul\'{e} set if $G-S$ is connected and has no perfect matching. We can see that a connected graph $G$ has no anti-Kekul\'{e} set if and only if each spanning tree of $G$ has a perfect matching. In this paper, by applying Tutte's 1-factor theorem and structure of minimally 2-connected graphs, we characterize all graphs whose each spanning tree has a perfect matching In addition, we show that if $G$ is a connected graph of order $2n… 

References

SHOWING 1-10 OF 15 REFERENCES
On the anti-Kekulé number and odd cycle transversal of regular graphs
  • D. Ye
  • Computer Science, Mathematics
    Discret. Appl. Math.
  • 2013
TLDR
It is shown that, if G is a cyclically (r+1)-edge-connected r-regular graph (r>=3) of even order, then either the anti-Kekule number of G is at least r+1, or G is not bipartite, and the smallest odd cycle transversal of G has at most r edges.
On the Anti-KekuleN u mber of a Hexagonal System ∗
A hexagonal system is a connected plane graph without cut vertices in which each interior face is a regular hexagon. Let H be a hexagonal system .A n anti- Kekule set of H is a set S of edges of H
NP-completeness of anti-Kekulé and matching preclusion problems
TLDR
It is shown that conditional matching preclusion problem and anti-Kekule problem are NP-complete, respectively, and some sufficient conditions to compute $s$-restricted matchingPreclusion numbers of regular graphs are given.
Graph Theory
TLDR
This book provides a systematic treatment of the theory of graphs without sacrificing its intuitive and aesthetic appeal, and is suitable as a textbook for advanced undergraduate and beginning graduate students in mathematics and computer science.
On the Anti-Kekule and Anti-Forcing Number of Cata-condensed Phenylenes
The anti-forcing number is defined as the smallest number of edges that have to be removed in order that any graph remains with a single Kekule structure. Simi- larly, the anti-Kekule number is
On the anti-Kekule number of fullerenes ⁄
The anti-Kekule number of a connected graph G is the smallest number of edges whose removal from G results in a connected subgraph without Kekule structures (perfect matchings). K. Kutnar et al.
The Anti-Kekule number of the infinite triangular, rectangular and hexagonal grids
The anti-Kekulé number is the smallest number of edges that must be removed from a connected graph with a perfect matching so that the graph remains connected, but has no perfect matching. In this
On the anti-Kekulé number of leapfrog fullerenes
The Anti-Kekulé number of a connected graph G is the smallest number of edges that have to be removed from G in such way that G remains connected but it has no Kekulé structures. In this paper it is
The Factorization of Linear Graphs
I . E . Borel, Lefons sur lea series divergentes (Paris, 1901), 164 et seq. 2. P. Dienes, The Taylor Series (Oxford, 1931). 3 . Y. Okada, " Uber die Annaherung analytischer Funktionen", Math.
On the anti-Kekulé number and anti-forcing number of cata-condensed benzenoids
Previously introduced concepts the anti-Kekulé number and anti-forcing number (Vukicevic et al., J. Math. chem., in press) are applied to cata-condensed benzenoids. It is shown that all
...
1
2
...