Upper bound of L0,1,2d,d,1-labeling number of a class of fissile graphs

MaRDI QIDQ5490560zbMATH OpenFDO

Authors Mingang Gao, Jiazhuang Liu

Publication date 4 October 2006

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• On \(L(d,1)\)-labelings of graphs
• L (2,1,1)-labeling of simple graphs
• scientific article; zbMATH DE number 2145257
• scientific article; zbMATH DE number 5812224
• The L(d₁,d₂)-labeling problem on graphs

This page was built for publication: Upper bound of \(L\binom{0,1,2}{d,d,1}\)-labeling number of a class of fissile graphs

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