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

DOI10.1016/J.DAM.2014.10.010MaRDI QIDQ479033zbMATH OpenOpenAlexFDO

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

Publication date 5 December 2014

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

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

zbMATH Keywords

amalgamationCartesian product\(L(d,1)\)-labelingcircular \(L(d,1)\)-labeling

Mathematics Subject Classification ID

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

Recommendations

• \(L(2,1)\)-labeling of flower snark and related graphs.
• \(L(2,1)\)-labelings of Cartesian products of two cycles
• On the \(L(2,1)\)-labelings of amalgamations of graphs
• scientific article; zbMATH DE number 1792593
• On \(L(d,1)\)-labelings of the Cartesian product of two cycles.

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1792593 (Why is no real title available?)
• scientific article; zbMATH DE number 2197889 (Why is no real title available?)
• 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
• Cyclic labellings with constraints at two distances
• Graph labeling and radio channel assignment
• Griggs and Yeh's conjecture and \(L(p,1)\)-labelings
• Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two
• Labeling outerplanar graphs with maximum degree three
• Labeling products of complete graphs with a condition at distance two
• Labelling Graphs with a Condition at Distance 2
• Labelling graphs with the circular difference
• On L(2,1)-labelings of Cartesian products of paths and cycles
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• On the \(L(2,1)\)-labelings of amalgamations of graphs
• On the \(L(p,1)\)-labelling of graphs
• Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids
• Path covering number and \(L(2,1)\)-labeling number of graphs
• Relating path coverings to vertex labellings with a condition at distance two
• \(L(2,1)\)-labelings of Cartesian products of two cycles
• L(2,1)-labelings on the modular product of two graphs
• \(L(p,q)\)-labeling of sparse graphs

Cited in

(4)

• On distance labelings of amalgamations and injective labelings of general graphs
• Distance two labeling on the square of a cycle
• \(L(2,1)\)-labeling of flower snark and related graphs.
• On irreducible no-hole \(L(2, 1)\)-coloring of Cartesian product of trees with paths

This page was built for publication: The minimum span of \(L(2,1)\)-labelings of generalized flowers

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