Exact -numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips

DOI10.1016/J.DAM.2011.10.021zbMATH Open1239.05160OpenAlexW1994767397MaRDI QIDQ412338FDOQ412338

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

Recommendations

• The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs
• On generalized Petersen graphs labeled with a condition at distance two
• The \(L(2,1)\)-labeling of certain generalized Petersen graphs
• On \(L(2,1)\)-labeling of generalized Petersen graphs
• Labeling crossed prisms with a condition at distance two

zbMATH Keywords

generalized Petersen graphchannel assignmentgraph labeling\(L(2,1)\)-labeling\(L(2,1)\)-coloringdistance two labeling

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• \(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
• A theorem on tait colorings with an application to the generalized Petersen graphs
• Parallel concepts in graph theory
• Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
• A survey on labeling graphs with a condition at distance two
• Title not available (Why is that?)
• Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs
• On the \(L(p,1)\)-labelling of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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 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

Cited In (4)

• \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs
• On generalized Petersen graphs labeled with a condition at distance two
• The Pfaffian property of graphs on the Möbius strip based on topological resolution
• Labeling crossed prisms with a condition at distance two

Uses Software

• bliss

This page was built for publication: Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412338)