Displaying similar documents to “Domination in n -cubes with diagonals”

Locally C n k graphs.

Buset, Dominique (1995)

Bulletin of the Belgian Mathematical Society - Simon Stevin

Similarity:

Vertex-Distinguishing IE-Total Colorings of Complete Bipartite Graphs Km,N(m < n)

Xiang’en Chen, Yuping Gao, Bing Yao (2013)

Discussiones Mathematicae Graph Theory

Similarity:

Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. Let C(u) be the set of colors of vertex u and edges incident to u under f. For an IE-total coloring f of G using k colors, if C(u) 6= C(v) for any two different vertices u and v of G, then f is called a k-vertex-distinguishing IE-total-coloring of G, or a k-VDIET coloring of G for short. The minimum number of colors required for a...