Handicap incomplete tournaments and ordered distance antimagic graphs

MaRDI QIDQ5405487zbMATH OpenFDO

Authors Dalibor Fronček

Publication date 2 April 2014

zbMATH Keywords

distance magic labelingmagic constant

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Regular incomplete tournaments with handicap two
• A note on incomplete regular tournaments with handicap two of order \(n\equiv 8 \pmod{16}\)
• Handicap distance antimagic graphs and incomplete tournaments
• Full spectrum of regular incomplete 2-handicap tournaments of order \(n \equiv 0 \pmod{16}\)
• On regular d-handicap tournaments

Cited in

(7)

• Spectra of graphs and closed distance magic labelings
• Regular incomplete tournaments with handicap two
• Handicap distance antimagic graphs and incomplete tournaments
• Magic partially filled arrays on abelian groups
• On regular handicap graphs of even order
• Regular handicap tournaments of high degree
• A note on handicap incomplete tournaments

This page was built for publication: Handicap incomplete tournaments and ordered distance antimagic graphs

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