Perfect 2-coloring of the quartic graphs with order at most 8

Perfect 2-coloring of the quartic graphs with order at most 8

In this paper, we study perfect 2-coloring of the quartic graphs with at most 8 vertices. The problem of the existence of perfect coloring is a generalization of the concept of completely regular codes, given by Delsarte.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematical Sciences 2019-09, Vol.13 (3), p.249-254
Hauptverfasser: Golzadeh, Yazdan, Alaeiyan, Mehdi, Gilani, Alireza
Format: Artikel
Sprache:eng
Schlagworte:
Apexes
Applications of Mathematics
Coloring
Graphs
Mathematics
Mathematics and Statistics
Original Research
Technology
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we study perfect 2-coloring of the quartic graphs with at most 8 vertices. The problem of the existence of perfect coloring is a generalization of the concept of completely regular codes, given by Delsarte.
ISSN:2008-1359
2251-7456
DOI:10.1007/s40096-019-00294-9