Previous Page 7

Displaying 121 – 129 of 129

Showing per page

Optimal Locating-Total Dominating Sets in Strips of Height 3

Ville Junnila (2015)

Discussiones Mathematicae Graph Theory

A set C of vertices in a graph G = (V,E) is total dominating in G if all vertices of V are adjacent to a vertex of C. Furthermore, if a total dominating set C in G has the additional property that for any distinct vertices u, v ∈ V C the subsets formed by the vertices of C respectively adjacent to u and v are different, then we say that C is a locating-total dominating set in G. Previously, locating-total dominating sets in strips have been studied by Henning and Jafari Rad (2012). In particular,...

Ordered vertex partitioning.

McConnell, Ross M., Spinrad, Jeremy P. (2000)

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

Currently displaying 121 – 129 of 129

Previous Page 7