✦ LIBER ✦

Maximal independent sets in bipartite graphs

✍ Scribed by Jiuqiang Liu

Publisher: John Wiley and Sons
Year: 1993
Tongue: English
Weight: 458 KB
Volume: 17
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190170407

No coin nor oath required. For personal study only.

✦ Synopsis

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. In this paper, we determine the maximum number of maximal independent sets among all bipartite graphs of order n and the extremal graphs as well as the corresponding results for connected bipartite graphs. © 1993 John Wiley & Sons, Inc.

📜 SIMILAR VOLUMES

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,

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

Maximal independent sets in graphs with

Maximal independent sets in graphs with at most r cycles

✍ Goh Chee Ying; Koh Khee Meng; Bruce E. Sagan; Vincent R. Vatter 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB 👁 1 views

## Abstract We find the maximum number of maximal independent sets in two families of graphs. The first family consists of all graphs with __n__ vertices and at most __r__ cycles. The second family is all graphs of the first family which are connected and satisfy __n__ ≥ 3__r__. © 2006 Wiley Period

Two trees in maximal planar bipartite gr

Two trees in maximal planar bipartite graphs

✍ Gerhard Ringel 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 127 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 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