𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximum independent sets of commuting and noninterfering inversions

✍ Scribed by Krister M Swenson; Yokuki To; Jijun Tang; Bernard ME Moret

Book ID
114998939
Publisher
BioMed Central
Year
2009
Tongue
English
Weight
388 KB
Volume
10
Category
Article
ISSN
1471-2105

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The structure and maximum number of maxi
The structure and maximum number of maximum independent sets in trees
✍ Jennifer Zito πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 732 KB

A subset of vertices is a maximum independent set if no two of the vertices are joined by an edge and the subset has maximum cardinality. In this paper we answer a question posed by Herb Wilf. We show that the greatest number of maximum independent sets for a tree of n vertices is 2(n-3\* for odd n

Maximum genus and maximum nonseparating
Maximum genus and maximum nonseparating independent set of a 3-regular graph
✍ Yuangqiu Huang; Yanpei Liu πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 440 KB

A set J C V is called a nonseparating independent set (nsis) of a connected graph G = (V, E), if J is an independent set of G, i.e., E A {uv [ Vu, v E J} = 0, and G -J is connected. We call z(G) = maxJ{lJ[ tJ is an nsis of G} the nsis number of G. Let G be a 3-regular connected graph; we prove that