L(1,1)-labelling of the direct product of a complete graph and a cycle

DOI10.1007/S10878-013-9669-XMaRDI QIDQ498455zbMATH OpenOpenAlexFDO

Authors Byeong Moon Kim, Yoomi Rho, Byung Chul Song

Publication date 28 September 2015

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

Full work available at URL https://doi.org/10.1007/s10878-013-9669-x

zbMATH Keywords

Kneser graphchannel assignment problemcycledirect productcomplete graph\(L(1,1)\)-labeling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• L(2, 1)-labellings for direct products of a triangle and a cycle
• \(l(3,2,1)\)-labeling for the product of a complete graph and a cycle
• \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs

Cites work

• scientific article; zbMATH DE number 3968609 (Why is no real title available?)
• scientific article; zbMATH DE number 867661 (Why is no real title available?)
• A bound on the chromatic number of the square of a planar graph
• A note on the chromatic number of the square of the Cartesian product of two cycles
• A survey on labeling graphs with a condition at distance two
• A survey on the distance-colouring of graphs
• Approximations for  -Colorings of Graphs
• Coloring the square of a planar graph
• Coloring the square of the Cartesian product of two cycles
• Distance two labelling and direct products of graphs
• Labeling Chordal Graphs: Distance Two Condition
• Labelling Graphs with a Condition at Distance 2
• Maximum bipartite subgraphs of Kneser graphs
• Models and approximation algorithms for channel assignment in radio networks
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• Structural Information and Communication Complexity
• \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs
• \(T\)-colorings of graphs: recent results and open problems

Cited in

(6)

• The \(L(3,2,1)\)-labeling number of the Cartesian product of a complete graph and a cycle.
• L(2, 1)-labellings for direct products of a triangle and a cycle
• Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles
• Distance two labelling and direct products of graphs
• \(l(3,2,1)\)-labeling for the product of a complete graph and a cycle
• New \(L(j,k)\)-labelings for direct products of complete graphs

This page was built for publication: \(L(1,1)\)-labelling of the direct product of a complete graph and a cycle

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