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

DOI10.1007/s10878-012-9520-9zbMath1311.90168OpenAlexW2098300418MaRDI QIDQ2444141

Qiong Wu, Wai Chee Shiu, Pak Kiu Sun

Publication date: 8 April 2014

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

Full work available at URL: https://doi.org/10.1007/s10878-012-9520-9

zbMATH Keywords

direct productcircular \(L(j,k)\)-labeling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (8)

\(L(j, k)\)-number of direct product of path and cycle ⋮ \(L(j,k)\)-labeling numbers of square of paths ⋮ \(L(p,q)\)-labeling and integer tension of a graph embedded on torus ⋮ \(L(j,k)\)-labeling number of Cartesian product of path and cycle ⋮ L(1, 2)-labeling numbers on square of cycles ⋮ L(h,k)-labelling for octagonal grid ⋮ On circular-L(2, 1)-labellings of products of graphs ⋮ \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cyclic labellings with constraints at two distances
• 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
• Labelling Graphs with a Condition at Distance 2
• Graph labeling and radio channel assignment
• Circular colorings of edge-weighted graphs
• Graph distance‐dependent labeling related to code assignment in computer networks
• 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: Circular \(L(j,k)\)-labeling number of direct product of path and cycle