L(1,1)-Labeling of direct product of cycles
DOI10.1142/S1793830916500038zbMath1333.05261arXiv1501.07335MaRDI QIDQ2798315
Deborah Olayide A. Ajayi, Tayo Charles Adefokun
Publication date: 12 April 2016
Published in: Discrete Mathematics, Algorithms and Applications, Proyecciones (Antofagasta) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.07335
cyclepath\(L(1,1)\)-labelingdirect product of graphscycle graphscross product of graphsD-2 coloring\(D\)-2 coloring
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- \(L(1,1)\)-labelling of the direct product of a complete graph and a cycle
- Coloring the square of the Cartesian product of two cycles
- Distance two labelling and direct products of graphs
- On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
- On \(L(d,1)\)-labelings of graphs
- \(L(2,1)\)-labelings of Cartesian products of two cycles
- Labeling Products of Complete Graphs with a Condition at Distance Two
- L(1,1)-Labeling of direct product of cycles
- The Kronecker Product of Graphs
- Labelling Graphs with a Condition at Distance 2
- Labeling Chordal Graphs: Distance Two Condition
- Coloring Powers of Planar Graphs
- On Regular Graphs Optimally Labeled with a Condition at Distance Two
- The $L(2,1)$-Labeling Problem on Graphs
- Labeling trees with a condition at distance two
This page was built for publication: L(1,1)-Labeling of direct product of cycles
