Contents

Ars Combinatoria

  • Research article

The Independence Number for the Generalized Petersen Graphs

Joseph Fox1, Ralucca Gera2, Pantelimon Stanica3
1Salem State College, Department of Mathematics, Salem, MA 01970; joseph.
2Neval Postgraduate School, Department of Applied Mathematics Monterey, CA 93943
3Neval Postgraduate School, Department of Applied Mathematics Monterey, CA 93943;
  • Published: 31/01/2012

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 \(\alpha(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 Generalized Petersen graphs.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Joseph Fox, Ralucca Gera, Pantelimon Stanica. The Independence Number for the Generalized Petersen Graphs[J], Ars Combinatoria, Volume 103. 439-451. .