\(L(j,k)\)-labeling number of Cartesian product of path and cycle

DOI10.1007/s10878-014-9775-4zbMath1331.05188OpenAlexW2028455309MaRDI QIDQ5963640

Qiong Wu, Pak Kiu Sun, Wai Chee Shiu

Publication date: 23 February 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-014-9775-4

zbMATH Keywords

cyclepathCartesian product\(L(j,k)\)-labeling

Mathematics Subject Classification ID

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

Related Items (1)

\(L(j,k)\)-labeling numbers of square of paths

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(L(j, k)\)-number of direct product of path and cycle
• 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
• Circular colorings of edge-weighted graphs
• Efficient distributions of arms‐control inspection effort
• Circular Distance Two Labeling and the $\lambda$-Number for Outerplanar Graphs
• Labeling trees with a condition at distance two
• Circular chromatic number: A survey
• Hamiltonicity and circular distance two labellings

This page was built for publication: \(L(j,k)\)-labeling number of Cartesian product of path and cycle