Distance two labelings of Cartesian products of complete graphs.

zbMATH Open1274.05425MaRDI QIDQ4909679FDOQ4909679

Authors Damei Lü, Wensong Lin, Zengmin Song 

Publication date 21 March 2013

zbMATH Keywords

Cartesian product\(L(2,1)\)-labeling\(\lambda _{2,1}\)-number

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• \(L(j,k)\)-labelings of Cartesian products of three complete graphs.
• \(L (2,1)\)-circular labelings of Cartesian products of complete graphs
• Labeling products of complete graphs with a condition at distance two
• scientific article; zbMATH DE number 1185300
• \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs

Cited In (11)

• Group path covering and \(L(j,k)\)-labelings of diameter two graphs
• \(L (2,1)\)-circular labelings of Cartesian products of complete graphs
• Distance-constrained labellings of Cartesian products of graphs
• Labeling products of complete graphs with a condition at distance two
• \(L(j,k)\)-labelings of Cartesian products of three complete graphs.
• \(L(j,k)\)-labeling number of Cartesian product of path and cycle
• \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs
• Distance three labelings for direct products of three complete graphs
• Distance two labeling of the composition of graphs
• More relations between \(\lambda \)-labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs
• On labeling the vertices of products of complete graphs with distance constraints

This page was built for publication: Distance two labelings of Cartesian products of complete graphs.

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