Year: 2014
Type: article
Abstract: A double-star is a tree with exactly two vertices of degree greater than 1. If T is a double-star where the two vertices of degree greater than one have degrees k 1 + 1 and k 2 + 1, then T is denoted by S k1,k2 . In this note, we show that every double-star with n edges decomposes every 2n-regular graph. We also show that the double-star S k,k-1 decomposes every 2k-regular graph that contains a perfect matching.
DOI: 10.7151/dmgt.1779
Institution: Illinois State University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W1967295114