Matrices Associated with D-Distance Magic Graphs and Their Properties

被引：0

作者：

Semeniuta, M. ^{[1
]}

Shulhin, V. ^{[1
]}

机构：

[1] Natl Aviat Univ, Flight Acad, Kropyvnytskyi, Ukraine

来源：

CYBERNETICS AND SYSTEMS ANALYSIS | 2019年 / 55卷 / 03期

关键词：

D-neighborhood; D-distance magic labeling; D-distance matrix; labeling matrix; D-distance magic matrix;

D O I：

10.1007/s10559-019-00151-6

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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 D-1-distance magic if and only if H is a D-2-distance magic graph. Graphs G and H are called magic distance-similar and their distance magic constants have been proved to coincide.

引用

页码：441 / 448

页数：8