The Independence Number for the Generalized Petersen Graphs
Loading...
Authors
Fox, Joseph
Gera, Ralucca
Stănică, Pantelimon
Advisors
Second Readers
Subjects
independence
Petersen Graph
Petersen Graph
Date of Issue
2012
Date
Publisher
Language
Abstract
Given 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.
Type
Article
Description
Ars Combinatoria 103 (2012), 439-451.
Ars Combin. 103 (2012) pp 439-451 (accepted 2007)
Ars Combin. 103 (2012) pp 439-451 (accepted 2007)
Series/Report No
Department
Applied Mathematics
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
Sponsors
Funding
Format
Citation
Ars Combinatoria 103 (2012), 439-451.
Distribution Statement
Rights
This 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.