✦ LIBER ✦

Efficient sets in graphs

✍ Scribed by P.J. Bernhard; S.T. Hedetniemi; D.P. Jacobs

Book ID: 104184493
Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 625 KB
Volume: 44
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90225-d

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient dominating sets in Cayley grap

Efficient dominating sets in Cayley graphs

✍ Italo J. Dejter; Oriol Serra 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 506 KB

An independent set C of vertices in a graph is an e cient dominating set (or perfect code) when each vertex not in C is adjacent to exactly one vertex in C. An E-chain is a countable family of nested graphs, each of which has an e cient dominating set. The Hamming codes in the n-cubes provide a clas

A self-stabilizing algorithm for optimal

A self-stabilizing algorithm for optimally efficient sets in graphs

✍ Sandra M. Hedetniemi; Stephen T. Hedetniemi; Hao Jiang; K.E. Kennedy; Alice A. M 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 121 KB

An efficient algorithm for minimum feedb

An efficient algorithm for minimum feedback vertex sets in rotator graphs

✍ Chi-Jung Kuo; Chiun-Chieh Hsu; Hon-Ren Lin; Kung-Kuei Lin 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 153 KB

F-Sets in graphs

✍ V Krishnamoorthy; K.R Parthasarathy 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 453 KB

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

Independent sets in regular graphs

✍ M. Rosenfeld 📂 Article 📅 1964 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 449 KB