Abstract
A tree containing exactly two non-pendant vertices is called a double-star. Let and be two positive integers. The double-star with degree sequence is denoted by . If is a cubic graph and has an -decomposition, for a double-star , then is isomorphic to , or . It is known that a cubic graph has an -decomposition if and only if it contains a perfect matching. In this paper we study the -decomposition of cubic graphs. First, we present some necessary conditions for the existence of an -decomposition in cubic graphs. Then we prove that every -free cubic graph of order with has an -decomposition, where denotes the independence number of . Finally, we obtain some results on the -decomposition of -regular graphs.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.