On Edge-Decomposition of Cubic Graphs into Copies of the Double-Star with Four Edges
A tree containing exactly two non-pendant vertices is called a double-star. Let k1 and k2 be two positive integers. The double-star with degree sequence (k1+1, k2+1, 1, ..., 1) is denoted by Sk1, k2. It is known that a cubic graph has an S1,1-decomposition if and only if it contains...
Main Author: | Abbas Seify |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Kashan
2018-06-01
|
Series: | Mathematics Interdisciplinary Research |
Subjects: | |
Online Access: | https://mir.kashanu.ac.ir/article_63511_00671cbdab52608c7230f8055860c91a.pdf |
Similar Items
-
On Double-Star Decomposition of Graphs
by: Akbari Saieed, et al.
Published: (2017-08-01) -
Decomposition of hypercube graphs into paths and cycles having k edges
by: D. Saranya, et al.
Published: (2025-01-01) -
Decomposition of complete bipartite graphs into cycles and stars with four edges
by: M. Ilayaraja, et al.
Published: (2020-09-01) -
Decompositions of Complete Bipartite Graphs and Complete Graphs Into Paths, Stars, and Cycles with Four Edges Each
by: Shyu Tay-Woei
Published: (2021-05-01) -
On the Decompositions of Complete Graphs into Cycles and Stars on the Same Number of Edges
by: Abueida Atif A., et al.
Published: (2014-02-01)