Decomposition of complete tripartite graphs into 5-cycles using the graph adjacency matrix

The problem of decomposing a complete tripartite graph into 5-cycles was first proposed in 1995 by Mahmoodian and Mirzakhani and since then many attempts have been made to decompose such graphs into 5-cycles. Such attempts were partially successful but parts of the problem still remain open. In this...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Kudarzi, Bahareh, Mahmoodian, E. S, Naghdabadi, Zahra
Format:	Artikel
Sprache:	eng
Schlagworte:	Mathematics - Combinatorics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!