A note on collections of graphs with non-surjective lambda labelings

DOI10.1016/J.DAM.2004.06.013zbMath1067.05067OpenAlexW2066755786MaRDI QIDQ1765378

John P. Georges, David W. Mauro

Publication date: 23 February 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2004.06.013

zbMATH Keywords

surjective\(\lambda\)-number\(\lambda\)-labeling\(L(2,\,1)\)-labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (4)

An extremal problem on non-full colorable graphs ⋮ Path covering number and \(L(2,1)\)-labeling number of graphs ⋮ On the hole index of \(L(2,1)\)-labelings of \(r\)-regular graphs ⋮ On island sequences of labelings with a condition at distance two

Cites Work

• Relating path coverings to vertex labellings with a condition at distance two
• Labeling trees with a condition at distance two.
• No-hole \(L(2,1)\)-colorings
• On \(L(d,1)\)-labelings of graphs
• Labeling Products of Complete Graphs with a Condition at Distance Two
• Full Color Theorems for L(2,1)-Colorings
• Labelling Graphs with a Condition at Distance 2
• Graph labeling and radio channel assignment
• Labeling Chordal Graphs: Distance Two Condition
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• The $L(2,1)$-Labeling Problem on Graphs
• On the Structure of Graphs with Non-Surjective L(2,1)-Labelings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on collections of graphs with non-surjective lambda labelings