Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips
DOI10.1016/j.dam.2011.10.021zbMath1239.05160OpenAlexW1994767397MaRDI QIDQ412338
Sarah Spence Adams, Harold Jaffe, Paul Booth, Denise Sakai Troxell, S. Luke Zinnen
Publication date: 4 May 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.10.021
channel assignmentgeneralized Petersen graphgraph labeling\(L(2,1)\)-labeling\(L(2,1)\)-coloringdistance two labeling
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (2)
Uses Software
Cites Work
- \(T\)-colorings of graphs: recent results and open problems
- Parallel concepts in graph theory
- Relating path coverings to vertex labellings with a condition at distance two
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
- On generalized Petersen graphs labeled with a condition at distance two
- The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs
- On the \(L(p,1)\)-labelling of graphs
- A survey on labeling graphs with a condition at distance two
- Labelling Graphs with a Condition at Distance 2
- On Regular Graphs Optimally Labeled with a Condition at Distance Two
- An extension of the channel-assignment problem: L(2, 1)-labelings of generalized Petersen graphs
- Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs
- A theorem on tait colorings with an application to the generalized Petersen graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips
