The L (d,1)-T labeling on claw-free graphs and splitted graphs

MaRDI QIDQ3110775zbMATH OpenFDO

Authors Lei Sun, Huijuan Wang

Publication date 27 January 2012

zbMATH Keywords

claw-free graphspanning tree\(T\) labelingsplitted graph

Mathematics Subject Classification ID

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

Recommendations

• On \(L(d,1)\)-labelings of graphs
• Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees
• A characterization of \(\lambda _{d,1}\)-minimal trees and other attainable classes
• The \(L(h,1,1)\)-labelling problem for trees
• The L(2,1)-labelling of trees

This page was built for publication: The \(L (d,1)\)-\(T\) labeling on claw-free graphs and splitted graphs

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