On the L(2,1)-labelings of amalgamations of graphs

DOI10.1016/J.DAM.2012.11.007MaRDI QIDQ1949093zbMATH OpenOpenAlexFDO

Authors Sarah Spence Adams, Noura Howell, Denise Sakai Troxell, Junjie Zhu, Nathaniel J. Karst

Publication date 25 April 2013

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

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

zbMATH Keywords

\(L(2,1)\)-coloring\(L(2,1)\)-labelingamalgamationCartesian productdistance two labeling

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Applications of graph theory (05C90)

Recommendations

• Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two
• On distance labelings of amalgamations and injective labelings of general graphs
• scientific article; zbMATH DE number 1792593
• The \(L(2,1)\)-labeling on graphs and the frequency assignment problem
• Frequency assignment through combinatorial optimization approach

Cites work

• \(L(2,1)\)-labelings of Cartesian products of two cycles
• A survey on labeling graphs with a condition at distance two
• Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
• Graph theory with applications
• Griggs and Yeh's conjecture and \(L(p,1)\)-labelings
• scientific article; zbMATH DE number 1792593 (Why is no real title available?)
• Labeling products of complete graphs with a condition at distance two
• Labeling the vertex amalgamation of graphs
• Labelling Graphs with a Condition at Distance 2
• On L(2,1)-labelings of Cartesian products of paths and cycles
• On felicitous graphs
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• On the \(L(p,1)\)-labelling of graphs
• Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination
• Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles
• Relating path coverings to vertex labellings with a condition at distance two
• Some Theorems on Abstract Graphs

Cited in

(4)

• On distance labelings of amalgamations and injective labelings of general graphs
• Labeling matched sums with a condition at distance two
• The minimum span of \(L(2,1)\)-labelings of generalized flowers
• Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two

This page was built for publication: On the \(L(2,1)\)-labelings of amalgamations of graphs

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