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

DOI10.1016/J.DAM.2011.10.021MaRDI QIDQ412338zbMATH OpenOpenAlexFDO

Authors Sarah Spence Adams, Paul Booth, Harold Jaffe, 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

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)

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

Cites work

• scientific article; zbMATH DE number 5764899 (Why is no real title available?)
• scientific article; zbMATH DE number 3823850 (Why is no real title available?)
• scientific article; zbMATH DE number 1792593 (Why is no real title available?)
• A survey on labeling graphs with a condition at distance two
• A theorem on tait colorings with an application to the generalized Petersen graphs
• An extension of the channel-assignment problem: L(2, 1)-labelings of generalized Petersen graphs
• Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
• Engineering an efficient canonical labeling tool for large and sparse graphs
• Labelling Graphs with a Condition at Distance 2
• On Regular Graphs Optimally Labeled with a Condition at Distance Two
• On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
• On generalized Petersen graphs labeled with a condition at distance two
• On the \(L(p,1)\)-labelling of graphs
• Parallel concepts in graph theory
• Relating path coverings to vertex labellings with a condition at distance two
• The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs
• \(T\)-colorings of graphs: recent results and open problems

Cited in

(7)

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

Describes a project that uses

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)