EUVIMEDEUVIMED entdecken
Crossref

On New Properties of Graphs with Magic Type Labeling

Marina F. Semeniuta, Zoya O. Sherman

Control Systems and Computers · 2019

DOI: 10.15407/csc.2019.03.015 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Control Systems and Computers, 2019. Verfasst von Marina F. Semeniuta und 1 weiteren Autor:innen. Die Arbeit nennt 15 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We have shown the connection between vertex labelings of magic graph and its overgraph. Also, we have introduced binary relation on the set of all D i -distance magic graphs, where D i ⊂ {0, 1, ..., d } , i = 1, 2, ... and proved, that it is equivalence relation. There-fore, we have explored the properties of the graphs, which are in this relation. Finally, we have offered the algorithm of constructing r-regular handicap graph G = ( V, E ) of order n, where n ≡ 0 ( mod8 ) , r ≡ 1,3 ( mod4 ) and 3 ≤ r ≤ n–5.

Zitieren

APA

Semeniuta, M. F., & Sherman, Z. O. (2019). On New Properties of Graphs with Magic Type Labeling. Control Systems and Computers. https://doi.org/10.15407/csc.2019.03.015

Vancouver

Semeniuta MF, Sherman ZO. On New Properties of Graphs with Magic Type Labeling. Control Systems and Computers. 2019. doi:10.15407/csc.2019.03.015

BibTeX
@article{Semeniuta2019,
  author = {Semeniuta, Marina F. and Sherman, Zoya O.},
  title = {On New Properties of Graphs with Magic Type Labeling},
  journal = {Control Systems and Computers},
  year = {2019},
  doi = {10.15407/csc.2019.03.015}
}
Kostenlos starten →