On the Structure of Graphs with Non-Surjective L(2,1)-Labelings

DOI10.1137/S0895480103429800zbMath1082.05078OpenAlexW1979964603MaRDI QIDQ5317610

John P. Georges, David W. Mauro

Publication date: 16 September 2005

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480103429800

zbMATH Keywords

\(L(21)\)-labelinghole index\(\lambda\)-labelingdominating vertex set

Mathematics Subject Classification ID

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

Related Items (8)

An extremal problem on non-full colorable graphs ⋮ Hole: An Emerging Character in the Story of Radio k-Coloring Problem ⋮ Path covering number and \(L(2,1)\)-labeling number of graphs ⋮ On the hole index of \(L(2,1)\)-labelings of \(r\)-regular graphs ⋮ A note on \(L (2, 1)\)-labelling of trees ⋮ On island sequences of labelings with a condition at distance two ⋮ A note on collections of graphs with non-surjective lambda labelings ⋮ A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number

This page was built for publication: On the Structure of Graphs with Non-Surjective L(2,1)-Labelings