\(L(j, k)\)-number of direct product of path and cycle
From MaRDI portal
Publication:2391993
DOI10.1007/s10114-013-2021-7zbMath1269.05097OpenAlexW2038100593MaRDI QIDQ2391993
Publication date: 6 August 2013
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-013-2021-7
Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)
Related Items (5)
\(L(j,k)\)-labeling numbers of square of paths ⋮ Lambda number for the direct product of some family of graphs ⋮ \(L(j,k)\)-labeling number of Cartesian product of path and cycle ⋮ L(1, 2)-labeling numbers on square of cycles ⋮ 2-distance colorings of some direct products of paths and cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(L(2,1)\)-labelings on the composition of \(n\) graphs
- On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
- \(L(2,1)\)-labeling of strong products of cycles
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
- \(L(2,1)\)-labeling of direct product of paths and cycles
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
- \(L(h,1)\)-labeling subclasses of planar graphs
- 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
- A survey on labeling graphs with a condition at distance two
- Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles
- Labeling Products of Complete Graphs with a Condition at Distance Two
- Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination
- Real Number Channel Assignments for Lattices
- Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment]
- The L(2,1)-labeling and operations of graphs
- Efficient distributions of arms‐control inspection effort
- On labeling the vertices of products of complete graphs with distance constraints
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- Labeling trees with a condition at distance two
This page was built for publication: \(L(j, k)\)-number of direct product of path and cycle
