Minimal rankings of the Cartesian product K_n K_m

DOI10.7151/DMGT.1634MaRDI QIDQ2866417zbMATH OpenOpenAlexFDO

Authors Gilbert Eyabi, Jobby Jacob, Darren Narayan, Dan Pillone, Renu C. Laskar

Publication date 13 December 2013

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/dmgt.1634

zbMATH Keywords

Cartesian product of graphsrank numbergraph coloringsrook's graphminimal rankingsarank numberrankings of graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• On the rank number of the Cartesian product \(K_m \square K_n\)
• Minimal rankings
• Arankings of trees
• Intermediate minimal \(k\)-rankings of graphs
• Maximum minimal \(k\)-rankings of cycles.

Cited in

(4)

• Arankings of trees
• Intermediate minimal \(k\)-rankings of graphs
• On the rank number of the Cartesian product \(K_m \square K_n\)
• scientific article; zbMATH DE number 6402478 (Why is no real title available?)

This page was built for publication: Minimal rankings of the Cartesian product \(K_n \square K_m\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2866417)