Optimal L(d,1)-labelings of certain direct products of cycles and Cartesian products of cycles

DOI10.1016/J.DAM.2005.04.007MaRDI QIDQ2576352zbMATH OpenOpenAlexFDO

Authors Sandi Klavžar, Aleksander Vesel, Pranava K. Jha

Publication date 27 December 2005

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2005.04.007

zbMATH Keywords

Cartesian product of graphs1)\)-labeling\(L(d

Mathematics Subject Classification ID

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

Recommendations

• Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]
• Optimal \(L(2,1)\)-labeling of Cartesian products of cycles, with an application to independent domination
• On \(L(d,1)\)-labelings of the Cartesian product of two cycles.
• On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
• On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
• \(L(2,1)\)-labelings of Cartesian products of two cycles
• scientific article; zbMATH DE number 1792593
• \(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles
• \(L(1,1)\)-labelling of the direct product of a complete graph and a cycle

Cites work

• scientific article; zbMATH DE number 1185300 (Why is no real title available?)
• scientific article; zbMATH DE number 1550912 (Why is no real title available?)
• scientific article; zbMATH DE number 1409224 (Why is no real title available?)
• Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
• Labeling products of complete graphs with a condition at distance two
• Labelling Graphs with a Condition at Distance 2
• On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]
• Relating path coverings to vertex labellings with a condition at distance two
• Smallest independent dominating sets in Kronecker products of cycles
• \(T\)-colorings of graphs: recent results and open problems

Cited in

(23)

• Radio number for the product of a path and a complete graph
• On \(L(d,1)\)-labelings of the Cartesian product of two cycles.
• L(2, 1)-labellings for direct products of a triangle and a cycle
• Coloring the square of the Cartesian product of two cycles
• The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs
• scientific article; zbMATH DE number 7688018 (Why is no real title available?)
• \(L(2,1)\)-colorings and irreducible no-hole colorings of the direct product of graphs
• Distance three labellings for \(K _n\times K_2\)
• \(L(j, k)\)-number of direct product of path and cycle
• \( (d,1)\)-total labeling of lexicographic products of some classes of graphs
• Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]
• On irreducible no-hole \(L(2, 1)\)-coloring of Cartesian product of trees with paths
• \(L(d,1)\)-labelings of the edge-path-replacement of a graph
• \(L(2,1)\)-colorings and irreducible no-hole colorings of Cartesian product of graphs
• Connectivity of Cartesian products of graphs
• \(L(2,1)\)-labelings of Cartesian products of two cycles
• On the \(L(2,1)\)-labelings of amalgamations of graphs
• THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE
• \(L(2, 1)\)-labelings of the edge-path-replacement of a graph
• 2-distance colorings of some direct products of paths and cycles
• Lambda number for the direct product of some family of graphs
• \(L(2,1)\)-labelings of the edge-multiplicity-paths-replacement of a graph
• \(L(h, k)\)-labelling for octagonal grid

This page was built for publication: Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles

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