Linear k-arboricity of Caylay Graphs on Abelian Groups with Given Degree

Linear k-arboricity of Caylay Graphs on Abelian Groups with Given Degree

A linear k -forest is a forest whose components are paths of length at most k . The linear k -arboricity of a graph G , denoted by la k ( G ) , is the least number of linear k -forests needed to decompose G . In this paper we study this invariant for Cayley graphs on Abelian groups with degree 3,4.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematics in computer science 2021-12, Vol.15 (4), p.743-755
Hauptverfasser: Jia, Nan, Mao, Yaping, Wang, Zhao, Cheng, Eddie
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science
Graphs
Group theory
Mathematics
Mathematics and Statistics
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A linear k -forest is a forest whose components are paths of length at most k . The linear k -arboricity of a graph G , denoted by la k ( G ) , is the least number of linear k -forests needed to decompose G . In this paper we study this invariant for Cayley graphs on Abelian groups with degree 3,4.
ISSN:1661-8270
1661-8289
DOI:10.1007/s11786-021-00503-6