Distance two labelings of Cartesian products of complete graphs.

MaRDI QIDQ4909679zbMATH OpenFDO

Authors Damei Lü, Wensong Lin, Zengmin Song

Publication date 21 March 2013

zbMATH Keywords

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

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

(12)

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

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)