Title of article :
total outer-convex domination number of graphs
Author/Authors :
yangyang, rubelyn university of san jose-recoletos - school of education, cebu, philippines , tarongoy, marylin university of san jose-recoletos - school of education, cebu, philippines , revilla, evangelyn university of san jose-recoletos - school of education, cebu, philippines , banlasan, rona mae university of san jose-recoletos - school of education, cebu, philippines , dayap, jonecis university of san jose-recoletos - school of arts and sciences, cebu, philippines
From page :
59
To page :
68
Abstract :
in this paper, we initiate the study of total outer-convex domination as a new variant of graph domination and we show the close relationship that exists between this novel parameter and other domination parameters of a graph such as total domination, convex domination, and outerc-onvex domination. furthermore, we obtain general bounds of total outer-convex domination number and, for some particular families of graphs, we obtain closed formulas.
Keywords :
domination number , total domination number , convex domination , total outer , convex domination number , grid graphs
Journal title :
Communications in Combinatorics and Optimization
Journal title :
Communications in Combinatorics and Optimization
Record number :
2704792
Link To Document :
بازگشت