On the L(2,~1)-labeling conjecture for brick product graphs

DOI10.1007/S10878-016-0101-1zbMATH Open1376.05136OpenAlexW2560359029WikidataQ123167076 ScholiaQ123167076MaRDI QIDQ1680482FDOQ1680482

Authors: Zehui Shao, XiaoSong Zhang, Huiqin Jiang, Bo Wang, Juanjuan He 

Publication date: 16 November 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-016-0101-1

Recommendations

• \(L(2,1)\)-labeling for brick product graphs
• \(L(2,1)\)-labelings on the modular product of two graphs
• Distance labellings of graphs
• \(L(2,1)\)-labelings on some products of \(n\) general graphs.
• scientific article; zbMATH DE number 6940804

zbMATH Keywords

graph labelingL(2, 1)-labelingbrick product graph

Mathematics Subject Classification ID

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

Cites Work

• The \(L(2,1)\)-labelling problem for cubic Cayley graphs on dihedral groups
• Labelling Graphs with a Condition at Distance 2
• \(L(2,1)\)-labeling for brick product graphs

Cited In (2)

• Improved upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs
• \(L(2,1)\)-labeling for brick product graphs

This page was built for publication: On the \(L\)(2,~1)-labeling conjecture for brick product graphs

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