Proper Disconnection of Graphs

For an edge-colored graph G , a set F of edges of G is called a proper edge-cut if F is an edge-cut of G and any pair of adjacent edges in F are assigned different colors. An edge-colored graph is proper disconnected if for each pair of distinct vertices of G there exists a proper edge-cut separatin...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Bulletin of the Malaysian Mathematical Sciences Society 2021-07, Vol.44 (4), p.2465-2477
Hauptverfasser:	Bai, Xuqing, Chen, You, Ji, Meng, Li, Xueliang, Weng, Yindi, Wu, Wenyan
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Applications of Mathematics Graph coloring Graph theory Graphs Mathematics Mathematics and Statistics Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!