The 1,2-conjecture for powers of cycles

DOI10.1016/J.ENDM.2015.07.015zbMATH Open1347.05089OpenAlexW2207474542WikidataQ122963767 ScholiaQ122963767MaRDI QIDQ324730FDOQ324730

Authors: C. N. Campos, Simone Dantas, Atílio G. Luiz, Diana Sasaki 

Publication date: 17 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.015

Recommendations

• Neighbour-distinguishing labellings of powers of paths and powers of cycles
• Total weight choosability of graphs: towards the 1-2-3-conjecture
• On a \(1,2\) conjecture
• On the total-neighbor-distinguishing index by sums
• Neighbour-sum-2-distinguishing edge-weightings: doubling the 1-2-3 conjecture

zbMATH Keywords

1,2-conjectureneighbour-distinguishingpowers of cyclestotal-weighting

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Paths and cycles (05C38)

Cites Work

• Edge weights and vertex colours
• On a \(1,2\) conjecture
• Title not available (Why is that?)
• A new upper bound for the irregularity strength of graphs
• A note on neighbour-distinguishing regular graphs total-weighting
• 1,2 conjecture-the multiplicative version

Cited In (9)

• On star and biclique edge-colorings
• Title not available (Why is that?)
• ON POWERS OF HALF-TWISTS IN M(0, 2n)
• THE HULL NUMBER OF POWERS OF CYCLES
• Title not available (Why is that?)
• 1,2 conjecture-the multiplicative version
• Neighbour-distinguishing labellings of powers of paths and powers of cycles
• A result on the total colouring of powers of cycles
• Compositions, decompositions, and conformability for total coloring on power of cycle graphs

This page was built for publication: The 1,2-conjecture for powers of cycles

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