On -labeling up to ten vertex disjoint C₄x+1

MaRDI QIDQ3567800zbMATH OpenFDO

Authors E. Butzen, Heather Jordon, A. Modica, R. Schrishuhn, S. I. El-Zanati

Publication date 17 June 2010

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5954411
• All 2 regular graphs with uniform odd components admit -labelings
• On -labeling the union of three cycles
• scientific article; zbMATH DE number 2190085
• On labeling 2-regular graphs where the number of odd components is at most 2

Cited in

(8)

• \(\rho\)-valuations for some stunted trees
• On labeling 2-regular graphs where the number of odd components is at most 2
• All 2 regular graphs with uniform odd components admit -labelings
• On -labeling the union of three cycles
• scientific article; zbMATH DE number 2104738 (Why is no real title available?)
• Subdivided shell flower graphs: -labeling
• On -labeling the union of three cycles
• scientific article; zbMATH DE number 2190085 (Why is no real title available?)

This page was built for publication: On \(\rho\)-labeling up to ten vertex disjoint \(C_{4x+1}\)

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