Combinatorial configurations in the definition of antimagic labelings of graphs

DOI10.1007/s10559-021-00344-yzbMath1478.05131OpenAlexW3147488049MaRDI QIDQ2043998

Marina F. Semeniuta

Publication date: 4 August 2021

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-021-00344-y

zbMATH Keywords

regular graphseparating systemantimagic labelingcombinatorial configurationbiregular graph\((a, d)\)-distance antimagic labelingmagic rectangle set

Mathematics Subject Classification ID

Trees (05C05) Combinatorial optimization (90C27) Orthogonal arrays, Latin squares, Room squares (05B15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Construction for antimagic generalized web graphs
• Balanced magic rectangles
• Configurations and graphs
• Publication history of von Staudt's ``Geometrie der Lage
• Computational synthetic geometry
• Configurations and graphs. II
• Centrally symmetric and magic rectangles
• A dynamic survey of graph labeling
• Graph approach to solving problems of combinatorial recognition
• \(G\)-designs and related designs
• On the existence of magic \(n\)-dimensional rectangles
• Theory and methods of Euclidian combinatorial optimization: current status and prospects
• Handicap distance antimagic graphs and incomplete tournaments
• A note on incomplete regular tournaments with handicap two of order n≡8(mod 16)
• On a problem concerning separating systems of a finite set
• Nets and Groups

This page was built for publication: Combinatorial configurations in the definition of antimagic labelings of graphs