Title of article
Open irredundance and maximum degree in graphs Original Research Article
Author/Authors
E.J. Cockayne، نويسنده , , O. Favaron، نويسنده , , Arthur S. Finbow، نويسنده , , C.M. Mynhardt، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
18
From page
5358
To page
5375
Abstract
A necessary and sufficient condition for an open irredundant set of vertices of a graph to be maximal is obtained. This result is used to show that the smallest cardinality amongst the maximal open irredundant sets in an image-vertex isolate-free graph with maximum degree image is at least image for image, image for image and image for image. The bounds are the best possible.
Keywords
Irredundance , Open irredundance , OC-irredundance
Journal title
Discrete Mathematics
Serial Year
2008
Journal title
Discrete Mathematics
Record number
947158
Link To Document