zbMATH — the first resource for mathematics

Minimal \(k\)-rankings for prism graphs. (English) Zbl 1221.05159
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.

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
PDF BibTeX Cite
Full Text: DOI Link