On the \(L(2,1)\)-labelings of amalgamations of graphs
From MaRDI portal
Publication:1949093
DOI10.1016/j.dam.2012.11.007zbMath1263.05086MaRDI QIDQ1949093
Denise Sakai Troxell, Junjie Zhu, Sarah Spence Adams, Noura Howell, 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
05C90: Applications of graph theory
05C15: Coloring of graphs and hypergraphs
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
05C76: Graph operations (line graphs, products, etc.)
Related Items
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
Cites Work
- Unnamed Item
- Unnamed Item
- On felicitous graphs
- Relating path coverings to vertex labellings with a condition at distance two
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
- On the \(L(p,1)\)-labelling of graphs
- \(L(2,1)\)-labelings of Cartesian products of two cycles
- A survey on labeling graphs with a condition at distance two
- Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles
- Labeling Products of Complete Graphs with a Condition at Distance Two
- Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination
- Griggs and Yeh's Conjecture and $L(p,1)$-labelings
- Labelling Graphs with a Condition at Distance 2
- Labeling the vertex amalgamation of graphs
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- Some Theorems on Abstract Graphs