Cybernetics And Systems Analysis logo
Editorial Board Announcements Abstracts Authors Archive
Cybernetics And Systems Analysis
International Theoretical Science Journal
UDC 519.1:512.643
М. Semeniuta1, V. Shulhin2


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

marina_semenyuta@ukr.net

2 Flight Academy of the National Aviation University,
Kropyvnytskyi, Ukraine

vashulgin@ukr.net

MATRICES ASSOCIATED WITH D-DISTANCE MAGIC GRAPHS
AND THEIR PROPERTIES

Abstract. Matrices associated with D -distance magic graphs are considered in the paper. Results regarding the spectral properties of these matrices have been obtained. It has been proved that if two graphs G and H of the same order have similar distance matrices AD1 and AD2 respectively, then graph G is D1 -distance magic if and only if H is a D2 -distance magic graph. Graphs G and H are called magic distance-similar and their distance magic constants have been proved to coincide.

Keywords: D -neighborhood, D -distance magic labeling, D -distance matrix, matrix of labeling, D -distance magic matrix.



FULL TEXT

REFERENCES

  1. Gallian J.A. A dynamic survey of graph labeling. The Electronic Journal of Combinatorics. 2017. DS6: Dec 22. 432 p.

  2. Miller M., Rodger C., Simanjuntak R. Distance magic labelings of graphs. Australasian Journal of Combinatorics. 2003. Vol. 28. P. 305–315.

  3. Vilfred V. Sigma labelled graphs and circulant graphs. Ph.D. Thesis, Uniersity of Kerala, India, March 1994.

  4. Beena S. On Σ and Σ ′ labelled graphs. Discrete Mathematics. 2009. Vol. 309. P. 1783–1787.

  5. Arumugam S., Froncek D., Kamatchi N. Distance magic graphs — a survey. Journal of the Indonesian Mathematical Society. Special Edition. 2011. P. 11–26.

  6. O’Neal A., Slater P. An introduction to distance magic graphs. Journal of the Indonesian Mathematical Society. Special Edition. 2011. P. 89–107.

  7. Anholcer M., Cichacz S., Peterin I. Spectra of graphs and closed distance magic labelings. Discrete Mathematics. 2016. Vol. 339. P. 1915–1923.

  8. Arumugam S., Kamatchi N. On the uniqueness of -vertex magic constant. Discussiones Mathematicae Graph Theory. 2014. Vol. 34. P. 279–286.

  9. Donets G. A. Solution of the safe problem on (0, 1)-matrices. Cybernetics and Systems Analysis. 2002. Vol. 38, N 1. P. 83–88.

  10. Cvetkovic D., Doob M., Sachs H. Spectra of graphs. Theory and application (Russian translation). Kiev: Nauk. Dumka, 1984. 384 p.

  11. Horn R., Johnson C. Matrix Analysis (Russian translation). Moscow: Mir, 1989. 655 p.

  12. Biggs N. Algebraic graph theory. Second edition. New York: Cambridge University Press, 1993. 205 p.
© 2019 Kibernetika.org. All rights reserved.