✦ LIBER ✦

Stable Set Bonding in Perfect Graphs and Parity Graphs

✍ Scribed by D.G. Corneil; J. Fonlupt

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 486 KB
Volume: 59
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1993.1049

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Independent perfect domination sets in C

Independent perfect domination sets in Cayley graphs

✍ Jaeun Lee 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB 👁 1 views

## Abstract In this paper, we show that a Cayley graph for an abelian group has an independent perfect domination set if and only if it is a covering graph of a complete graph. As an application, we show that the hypercube __Q~n~__ has an independent perfect domination set if and only if __Q~n~__ i

Parity equivalence in eulerian graphs

✍ Sabidussi, Gert 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB 👁 2 views

Given a connected eulerian graph, we consider the question-related to the factorisation of regular graphs of even degree-under what conditions the distance of two edges e, e in an eulerian walk (i.e., the number of edges intervening between e and e ) always is of the same parity. A characterisation

Set domination in graphs

✍ E. Sampathkumar; L. Pushpa Latha 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 355 KB

## Abstract Let __G__ = (__V, E__) be a connected graph. A set __D__ ⊂ __V__ is a __set‐dominating set__ (sd‐set) if for every set __T__ ⊂ __V__ − __D__, there exists a nonempty set __S__ ⊂ __D__ such that the subgraph 〈__S__ ∪ __T__〉 induced by __S__ ∪ __T__ is connected. The set‐domination number

Tutte sets in graphs I: Maximal tutte se

Tutte sets in graphs I: Maximal tutte sets and D-graphs

✍ D. Bauer; H. J. Broersma; A. Morgana; E. Schmeichel 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 177 KB

## Abstract A well‐known formula of Tutte and Berge expresses the size of a maximum matching in a graph __G__ in terms of what is usually called the deficiency of __G__. A subset __X__ of __V__(__G__) for which this deficiency is attained is called a Tutte set of __G__. While much is known about ma

Parity theorems for paths and cycles in

Parity theorems for paths and cycles in graphs

✍ J. A. Bondy; F. Y. Halberstam 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 294 KB 👁 1 views

We extend an elegant proof technique of A . G . Thomason, and deduce several parity theorems for paths and cycles in graphs. For example, a graph in which each vertex is of even degree has an even number of paths if and only if it is of even order, and a graph in which each vertex is of odd degree h

Perfect pairs of trees in graphs

✍ Ladislav Novak; Alan Gibbons 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 392 KB