Superior Eccentric Domination in some Quadrilateral Snake Graphs
M. Bhanumathi, R. Meenal Abirami · Journal of Emerging Technologies and Innovative Research · 2019
In 2017 we define superior eccentric domination in graphs. A superior dominating set S of vertices of G is called a superior eccentric dominating set if every vertex of V (G) S has some superior eccentric vertex in S. A superior eccentric dominating set of G of minimum cardinality is a minimum superior eccentric dominating set and its cardinality is called the superior eccentric domination number and is denoted by sed(G). In this paper we initiate the study of superior eccentric dominating sets in quadrilateral snake graphs, alternate quadrilateral snake graphs, double quadrilateral snake graphs and double alternate quadrilateral snake graphs