Distance-two labelings of digraphs
From MaRDI portal
Publication:881579
DOI10.1016/j.dam.2006.11.001zbMath1129.05040arXivmath/0407167OpenAlexW2149737407MaRDI QIDQ881579
Publication date: 30 May 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0407167
Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Directed graphs (digraphs), tournaments (05C20)
Related Items
\(L(2, 1)\)-labeling of the Cartesian and strong product of two directed cycles, \(L(2,1)\)-labelings of some families of oriented planar graphs, \(L(2,1)\)-labeling of oriented planar graphs, Unnamed Item, Anti-\(k\)-labeling of graphs, On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path, \(L(p,q)\)-labeling of digraphs, Combinatorial optimization in system configuration design
Cites Work
- Relating path coverings to vertex labellings with a condition at distance two
- Labeling trees with a condition at distance two.
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
- No-hole \(L(2,1)\)-colorings
- On \(L(d,1)\)-labelings of graphs
- Labelling graphs with the circular difference
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
- On generalized Petersen graphs labeled with a condition at distance two
- Distance-two labelings of graphs
- Labeling Products of Complete Graphs with a Condition at Distance Two
- Pair Labellings with Given Distance
- Labelling Graphs with a Condition at Distance 2
- Graph labeling and radio channel assignment
- Labeling Chordal Graphs: Distance Two Condition
- A Theorem about the Channel Assignment Problem
- Labeling Planar Graphs with Conditions on Girth and Distance Two
- On Regular Graphs Optimally Labeled with a Condition at Distance Two
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- The $L(2,1)$-Labeling Problem on Graphs
- The edge span of distance two labellings of graphs
- Hamiltonicity and circular distance two labellings
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
