Skip to main content
SpringerLink
Log in

Combinatorial Configurations in the Definition of Antimagic Labelings of Graphs

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

We have formalized the definition of graph labeling in terms of combinatorial configurations. We have investigated the connection between edge and vertex (a, d)–distance antimagic labelings with such well-known configurations as separating systems and magic rectangle sets. We have obtained a solution to the problem of construction of indicated labelings for some types of graphs and certain values of a and d.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ch. J. Colbourn, J. H. Dinitz, Handbook of Combinatorial Designs, 2nd ed., in: Ch. J. Colbourn, J. H. Dinitz (eds.), Discrete Mathematics and Its Applications, Chapman & Hall/Taylor & Francis, New York (2007).

    Google Scholar 

  2. V. N. Sachkov, Combinatorial Methods in Discrete Mathematics [in Russian], Nauka, Moscow (1977).

    Google Scholar 

  3. R. Hartshorne, “Publication history of von Staudt’s Geometrie der Lage,” Archive for History of Exact Sciences, Vol. 62, Iss. 3, 297–299 (2008).

  4. H. Gropp, “Configurations and graphs,” Discrete Mathematics, Vol. 111, 269–276 (1993).

  5. H. Gropp, “Configurations and graphs — II,” Discrete Mathematics, Vol. 164, 155–163 (1997).

  6. J. Bokowski and B. Sturmfels, Computational Synthetic Geometry; Lecture Notes in Mathematics, Vol. 1355, Springer-Verlag, Berlin–Heidelberg (1989).

    Book  Google Scholar 

  7. R. Baer, “Nets and groups,” Transactions of the American Mathematical Society, Vol. 46, 110–141 (1939).

  8. R. Baer, “Nets and groups. II,” Transactions of the American Mathematical Society, Vol. 47, 435–439 (1940).

    Article  MathSciNet  Google Scholar 

  9. P. J. Cameron and J. H. van Lint, Graph Theory, Coding Theory and Block Designs [Russian translation], Nauka, Moscow (1980).

    Google Scholar 

  10. K. Ushio, “G-designs and related designs,” Discrete Mathematics, Vol. 116, 299–311 (1993).

  11. G. A. Donets, “Graph approach to solving problems of combinatorial recognition,” Cybern. Syst. Analysis, Vol. 53, No. 6, 857–865 (2017). https://doi.org/10.1007/s10559-017-9987-6.

    Article  MATH  Google Scholar 

  12. C. Berge, Principes de Combinatoire, Dunod, Paris (1968).

    MATH  Google Scholar 

  13. Y. G. Stoyan, S. V. Yakovlev, “Theory and methods of Euclidian combinatorial optimization: Current status and prospects,” Cybern. Syst. Analysis, Vol. 56, No. 3, 366–379 (2020). https://doi.org/10.1007/s10559-020-00253-6.

    Article  MATH  Google Scholar 

  14. L. Rylands, O. Phanalasy, J. Ryan, and M. Miller, “Construction for antimagic generalized web graphs,” AKCE Int. J. Graphs Comb., Vol. 8, No. 2, 141–149 (2011).

    MathSciNet  MATH  Google Scholar 

  15. N. Hartsfield and G. Ringel, “Supermagic and antimagic graphs,” J. Recreat. Math., Vol. 21, No. 2, 107–115 (1989).

    MATH  Google Scholar 

  16. D. Froncek, “Handicap distance antimagic graphs and incomplete tournaments,” AKCE Int. J. Graphs Comb., Vol. 10, No. 2, 119–127 (2013).

    MathSciNet  MATH  Google Scholar 

  17. S. Arumugam and N. Kamatchi, “On (a, d)-distance antimagic graphs,” Australasian J. of Combinatorics, Vol. 54, 279–287 (2012).

    MathSciNet  MATH  Google Scholar 

  18. J. A. Gallian, “A dynamic survey of graph labeling,” 22nd ed., The Electronic J. of Combinatorics, #DS6 (2019).

  19. A. Renyi, “On random generating elements of a finite Boolen algebra,” Acta Sci. Math., Vol. 22, No. 1–2, 75–81 (1961).

    MathSciNet  MATH  Google Scholar 

  20. T. J. Dickson “On a problem concerning separating systems of a finite set,” J. of Combinatorial Theory, Vol. 7, Iss. 3, 191–196 (1969).

  21. I. T. Roberts, Extremal Problems and Designs on Finite Sets, Ph.D. Thesis, Curtin Univ. of Technology, Bentley (Perth), Australia (1999).

  22. T. Bier and D. G. Rogers, “Balanced magic rectangles,” European J. of Combinatorics, Vol. 14, Iss. 4, 285–299 (1993).

  23. T. Bier and A. Kleinschmidt, “Centrally symmetric and magic rectangles,” Discrete Mathematics, Vol. 176, 29–42 (1997).

  24. T. Hagedorn, “On the existence of magic n-dimensional rectangles,” Discrete Mathematics, Vol. 207, 53–63 (1999).

  25. D. Froncek, “A note on incomplete regular tournaments with handicap two of order n ≡ 8 (mod16) ,” Opuscula Math., Vol. 37, No. 4, 557–566 (2017).

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Flight Academy of the National Aviation University, Kropyvnytskyi, Ukraine

    M. F. Semeniuta

Authors
  1. M. F. Semeniuta
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. F. Semeniuta.

Additional information

Translated from Kibernetyka ta Systemnyi Analiz, No. 2, March–April, 2021, pp. pp. 30–40.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Semeniuta, M.F. Combinatorial Configurations in the Definition of Antimagic Labelings of Graphs. Cybern Syst Anal 57, 196–204 (2021). https://doi.org/10.1007/s10559-021-00344-y

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-021-00344-y

Keywords

Search

Navigation