๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The independent set sequence of regular bipartite graphs

โœ Scribed by David Galvin

Book ID
113567713
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
246 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Maximal independent sets in bipartite gr
Maximal independent sets in bipartite graphs
โœ Jiuqiang Liu ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 458 KB ๐Ÿ‘ 1 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.__ 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

Independent sets in regular graphs
Independent sets in regular graphs
โœ M. Rosenfeld ๐Ÿ“‚ Article ๐Ÿ“… 1964 ๐Ÿ› The Hebrew University Magnes Press ๐ŸŒ English โš– 449 KB
Decompositions of regular bipartite grap
Decompositions of regular bipartite graphs
โœ Michael S. Jacobson; Miroslaw Truszczyล„ski; Zsolt Tuza ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 692 KB

In this paper we discuss isomorphic decompositions of regular bipartite graphs into trees and forests. We prove that: (1) there is a wide class of r-regular bipartite graphs that are decomposable into any tree of size r, (2) every r-regular bipartite graph decomposes into any double star of size r,

Bipartite graphs can have any number of
Bipartite graphs can have any number of independent sets
โœ V. Linek ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 476 KB

In this paper we prove that for every positive integer n there exists a bipartite graph with exactly n independent sets.