Totally Silver Graphs
Ghebleh, M. · Mahmoodian, E. S.
Original · EN
A totally silver coloring of a graph G is a k--coloring of G such that for every vertex v ∈ V(G), each color appears exactly once on N[v], the closed neighborhood of v. A totally silver graph is a graph which admits a totally silver coloring. Totally silver coloring are directly related to other areas of graph theory such as distance coloring and domination. In this work, we present several constructive characterizations of totally silver graphs and bipartite totally silver graphs. We give several infinite families of totally silver graphs. We also give cubic totally silver graphs of girth up to 10.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.