𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Counting maximal independent sets in directed path graphs

✍ Scribed by Lin, Min-Sheng; Su, Sheng-Huang

Book ID
124128432
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
274 KB
Volume
114
Category
Article
ISSN
0020-0190

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

On Counting Independent Sets in Sparse G
On Counting Independent Sets in Sparse Graphs
✍ Dyer, Martin; Frieze, Alan; Jerrum, Mark πŸ“‚ Article πŸ“… 2002 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 194 KB
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,