2 papers
math.CO2013
Totally Silver Graphs
M. Ghebleh, E. S. Mahmoodian
A totally silver coloring of a graph G is a k--coloring of G such that for every vertex v \in V(G), each color appears exactly once on N[v], the closed neighborhood of v. A totally…
math.CO2012
Locating and Identifying Codes in Circulant Networks
M. Ghebleh, L. Niepel
A set S of vertices of a graph G is a dominating set of G if every vertex u of G is either in S or it has a neighbour in S. In other words, S is dominating if the sets S\cap N[u] w…