THE SUBSTANTIAL INDEPENDENCE NUMBER FOR THE GENERALIZED PETERSON GRAPH.

Cite this:
S. Robinson Chellathurai, V. R. R. B. (2013). THE SUBSTANTIAL INDEPENDENCE NUMBER FOR THE GENERALIZED PETERSON GRAPH. Asian Journal of Current Engineering and Maths, 2(1). Retrieved from http://innovativejournal.in/index.php/ajcem/article/view/150
© 2022 Interactive Protocols
RIGHTS & PERMISSIONS
Article Views
146
Altmetric
1
Citations
-
LEARN ABOUT THESE METRICS
   PDF  

Abstract

Given a graph G, a substantial independent set S is a subset of the vertices G which satisfies the conditions namely, S is an independent set of G and more over every vertex in V\S is adjacent to at most one vertex in S. The substantial independence number  is the maximum cardinality of a maximal substantial independent set S of G. In this paper we study the substantial independence number for the generalized Petersen graphs, by finding both sharp bounds and exact results for the Generalized Peterson Graphs.

 AMS No.:  05C69

KEYWORDS:

 Special Issue

Article Metrics Graph

Chart Graph | Range Graph

Content

Section

Source

License

COPYRIGHT AGREEMENT AND AUTHORSHIP RESPONSIBILITY

 

All paper submissions must carry the following duly signed by all the authors:

“I certify that I have participated sufficiently in the conception and design of this work and the analysis of the data (wherever applicable), as well as the writing of the manuscript, to take public responsibility for it. I believe the manuscript represents valid work. I have reviewed the final version of the manuscript and approve it for publication. Neither has the manuscript nor one with substantially similar content under my authorship been published nor is being considered for publication elsewhere, except as described in an attachment. Furthermore I attest that I shall produce the data upon which the manuscript is based for examination by the editors or their assignees, if requested.”