Packing three copies of a tree into its sixth power

A graph H of order n is said to be k - p l a c e a b l e into a graph G , having the same order n , if G contains k edge-disjoint copies of H . Kaneko et al. [9] proved that any non-star tree T is 2 - p l a c e a b l e into its third power T 3 . In this paper, we give a particular interest on the 3...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Indian journal of pure and applied mathematics 2021-06, Vol.52 (2), p.558-570
Hauptverfasser:	Louleb, Tarak, Sayar, Mohamed Y., Beggas, Fairouz, Kheddouci, Hamamache
Format:	Artikel
Sprache:	eng
Schlagworte:	Applications of Mathematics Mathematics Mathematics and Statistics Numerical Analysis Original Research Physical Sciences Science & Technology
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!