Show simple item record

dc.contributor.authorFox, Joseph
dc.contributor.authorGera, Ralucca
dc.contributor.authorStanica, Pantelimon
dc.date.accessioned2014-02-18T23:35:49Z
dc.date.available2014-02-18T23:35:49Z
dc.date.issued2012
dc.identifier.citationArs Combinatoria 103 (2012), 439-451.
dc.identifier.urihttp://hdl.handle.net/10945/38836
dc.descriptionArs Combinatoria 103 (2012), 439-451.en_US
dc.descriptionArs Combin. 103 (2012) pp 439-451 (accepted 2007)en_US
dc.description.abstractGiven a graph G, an independent set (I(G) is a subset of the vertices of G such that no two vertices in I(G) are adjacent. The independence number (G) is the order of a largest set of independent vertices. In this paper, we study the independence number for the Generalized Petersen graphs, finding both sharp bounds and exact results for subclasses of the Genralized Petersen graphs.en_US
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.en_US
dc.titleThe Independence Number for the Generalized Petersen Graphsen_US
dc.contributor.corporateNaval Postgraduate School, Monterey, California
dc.contributor.departmentApplied Mathematics
dc.subject.authorindependenceen_US
dc.subject.authorPetersen Graphen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record