All 2 regular graphs with uniform odd components admit -labelings

zbMATH Open1256.05212MaRDI QIDQ2906858FDOQ2906858

Authors: D. I. Gannon, S. I. El-Zanati 

Publication date: 5 September 2012

Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://ajc.maths.uq.edu.au/pdf/53/ajc_v53_p207.pdf

Recommendations

• scientific article
• On labeling 2-regular graphs where the number of odd components is at most 2
• On \(\rho\)-labeling up to ten vertex disjoint \(C_{4x+1}\)
• scientific article; zbMATH DE number 2190085
• On \(\rho\)-labeling the union of three cycles

zbMATH Keywords

2-regular graphs\(\rho\)-labelings

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (9)

• Title not available (Why is that?)
• \(2n\)-cyclic blended labeling of graphs.
• Title not available (Why is that?)
• Title not available (Why is that?)
• On \(\rho\)-labeling up to ten vertex disjoint \(C_{4x+1}\)
• Product rosy labeling of graphs
• On \(\rho\)-labeling the union of three cycles
• Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph \(G\) where \(G\) is the union of two disjoint cycles
• On Decomposing the Complete Graph into the Union of Two Disjoint Cycles

This page was built for publication: All 2 regular graphs with uniform odd components admit \(\rho\)-labelings

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