Minimal \(k\)-rankings for prism graphs. (English) Zbl 1221.05159

Ortiz, Juan; Zemke, Andrew; King, Hala; Narayan, Darren; Horňák, Mirko

Involve 3, No. 2, 183-190 (2010).

Summary: We determine rank numbers for the prism graph \(P_2 \times C_n\) (\(P_2\) being the connected two-node graph and \(C_n\) a cycle of length \(n\)) and for the square of an even cycle.

MSC:

05C15	Coloring of graphs and hypergraphs
05C78	Graph labelling (graceful graphs, bandwidth, etc.)
05C69	Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
05C35	Extremal problems in graph theory

Keywords:

\(k\)-rankings; vertex coloring; prism graphs