>
Fa   |   Ar   |   En
   on edge-decomposition of cubic graphs into copies of the double-star with four edges‎  
   
نویسنده seify abbas
منبع mathematics interdisciplinary research - 2018 - دوره : 3 - شماره : 1 - صفحه:67 -74
چکیده    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 a perfect matching. in this paper, we study the s1,2-decomposition of cubic graphs. we present some necessary and some sufficient conditions for the existence of an s1,2-decomposition in cubic graphs.
کلیدواژه edge-decomposition ,double-star ,cubic graph ,regular graph ,bipartite graph
آدرس shahid rajaei teacher training university, department of sciences, iran
پست الکترونیکی abbas.seify@gmail.com
 
     
   
Authors
  
 
 

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved