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

DOI10.1137/S0895480103429800MaRDI QIDQ5317610zbMATH OpenOpenAlexFDO

Authors John P. Georges, David 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

1)\)-labeling\(\lambda\)-labeling\(L(2dominating vertex sethole index

Mathematics Subject Classification ID

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

Recommendations

• A note on collections of graphs with non-surjective lambda labelings
• Construction of Large Graphs with No Optimal Surjective L(2,1)-Labelings
• On island sequences of labelings with a condition at distance two
• L(2,1)-labeling of graphs: known results and open problems
• An extremal problem on non-full colorable graphs

Cited in

(12)

• 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
• 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
• Construction of Large Graphs with No Optimal Surjective L(2,1)-Labelings
• Hole: An Emerging Character in the Story of Radio k-Coloring Problem
• On Non-Eliminative Structuralism. Unlabeled Graphs as a Case Study, Part B†
• A note on \(L (2, 1)\)-labelling of trees
• The L(d,1)-hole index of paths and cycles
• On the non-existence of an \(R\)-labeling
• On island sequences of labelings with a condition at distance two

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

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