On circular-L(2, 1)-labellings of products of graphs

DOI10.1080/00207160.2014.905682zbMath1314.05184OpenAlexW1990877814MaRDI QIDQ5259049

Wensong Lin, Yan Sun

Publication date: 24 June 2015

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2014.905682

zbMATH Keywords

cyclepathCartesian productcomplete graphdirect productcircular-\(L(2,1)\)-labelling number

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Distance two labelling and direct products of graphs
• \(L(2,1)\)-labeling of direct product of paths and cycles
• On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
• Circular \(L(j,k)\)-labeling number of direct product of path and cycle
• Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
• \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs
• A survey on labeling graphs with a condition at distance two
• L(2, 1)-labellings for direct products of a triangle and a cycle
• Labelling Graphs with a Condition at Distance 2
• Graph labeling and radio channel assignment
• Circular colorings of edge-weighted graphs
• A Radio Coloring of a Hypercube
• On theL(2, 1)-labelling of block graphs
• Hamiltonicity and circular distance two labellings
• Fixed-parameter complexity of \(\lambda\)-labelings

This page was built for publication: On circular-L(2, 1)-labellings of products of graphs