✦ LIBER ✦

Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs

✍ Scribed by Wenan Zang

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 639 KB
Volume: 143
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00019-f

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Disjoint cliques and disjoint maximal in

Disjoint cliques and disjoint maximal independent sets of vertices in graphs

✍ Paul Erdös; Arthur M. Hobbs; C. Payan 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 548 KB

Constraints on the number of maximal ind

Constraints on the number of maximal independent sets in graphs

✍ Jiuqiang Liu 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 387 KB 👁 2 views

## Abstract A maximal independent set of a graph __G__ is an independent set that is not contained properly in any other independent set of __G__. Let __i(G)__ denote the number of maximal independent sets of __G__. Here, we prove two conjectures, suggested by P. Erdös, that the maximum number of m

The number of maximal independent sets i

The number of maximal independent sets in connected graphs

✍ Zoltán Füredi 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB 👁 2 views

Generalizing a theorem of Moon and Moser. we determine the maximum number of maximal independent sets in a connected graph on n vertices for n sufficiently large, e.g., n > 50. = I .32. . .). Example 1.2. Let b, = i(C,), where C,z denotes the circuit of length n. Then b, = 3, 6, = 2, b, = 5, and b,

Maximal sets of hamilton cycles in compl

Maximal sets of hamilton cycles in complete multipartite graphs

✍ Mike Daven; J. A. MacDougall; C. A. Rodger 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 2 views

## Abstract A set __S__ of edge‐disjoint hamilton cycles in a graph __G__ is said to be __maximal__ if the edges in the hamilton cycles in __S__ induce a subgraph __H__ of __G__ such that __G__ − __E__(__H__) contains no hamilton cycles. In this context, the spectrum __S__(__G__) of a graph __G__ i

Independent sets of maximal size in tens

Independent sets of maximal size in tensor powers of vertex-transitive graphs

✍ Cheng Yeaw Ku; Benjamin B. McMillan 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 97 KB 👁 2 views

## Abstract Let __G__ be a connected, nonbipartite vertex‐transitive graph. We prove that if the only independent sets of maximal cardinality in the tensor product __G__ × __G__ are the preimages of the independent sets of maximal cardinality in __G__ under projections, then the same holds for all