Title of article :
Total irredundance in graphs Original Research Article
Author/Authors :
Odile Favaron، نويسنده , , Teresa W. Haynes، نويسنده , , Stephen T. Hedetniemi، نويسنده , , Michael A. Henning، نويسنده , , Debra J. Knisley، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2002
Abstract :
A set S of vertices in a graph G is called a total irredundant set if, for each vertex v in G, v or one of its neighbors has no neighbor in S−{v}. We investigate the minimum and maximum cardinalities of maximal total irredundant sets.
Keywords :
Domination , Total domination , Irredundance , Total irredundance
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
