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

DOI10.1016/J.DAM.2005.04.007zbMATH Open1084.05060OpenAlexW2112294028MaRDI QIDQ2576352FDOQ2576352

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (23)

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

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)