Maximal independent sets in graphs with at most r cycles

13 years 11 months ago

Download www.mth.msu.edu

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 3r. Partially supported by an award from DIMACS and an NSF VIGRE grant to the Rutgers University Department of Mathematics. 1

Goh Chee Ying, Koh Khee Meng, Bruce E. Sagan, Vinc

Real-time Traffic

JGT 2006 | Maximal Independent Sets | Maximum Number | NSF VIGRE Grant |

claim paper

» Independent dominating sets and hamiltonian cycles

» Generating Maximal Independent Sets for Hypergraphs with Bounded EdgeIntersections

» Maximizing Maximal Angles for Plane StraightLine Graphs

» Inexpensive ddimensional matchings

» Extremal Problems For Transversals In Graphs With Bounded Degree

» The DemandMatching Problem

» Induced Subgraphs of Bounded Degree and Bounded Treewidth

» Parity check matrices and product representations of squares

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	JGT
Authors	Goh Chee Ying, Koh Khee Meng, Bruce E. Sagan, Vincent R. Vatter

Comments (0)

Sciweavers

Maximal independent sets in graphs with at most r cycles

JGT 2006 | Maximal Independent Sets | Maximum Number | NSF VIGRE Grant |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers