Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two

DOI10.1016/j.dam.2014.06.022zbMath1297.05203OpenAlexW1973416447MaRDI QIDQ741539

Denise Sakai Troxell, Jessica Oehrlein, Junjie Zhu, Nathaniel J. Karst

Publication date: 12 September 2014

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

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

zbMATH Keywords

Cartesian productamalgamation\(L(2,1)\)-labelingdistance-two labelingminimum makespan scheduling

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

The minimum span of \(L(2,1)\)-labelings of generalized flowers

Cites Work

• Unnamed Item
• \(L(2,1)\)-labelings on the modular product of two graphs
• Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids
• Relating path coverings to vertex labellings with a condition at distance two
• Labeling outerplanar graphs with maximum degree three
• On the \(L(2,1)\)-labelings of amalgamations of graphs
• Path covering number and \(L(2,1)\)-labeling number of graphs
• On the \(L(p,1)\)-labelling of graphs
• A survey on labeling graphs with a condition at distance two
• Labeling Products of Complete Graphs with a Condition at Distance Two
• Griggs and Yeh's Conjecture and $L(p,1)$-labelings
• Labelling Graphs with a Condition at Distance 2

This page was built for publication: Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two