Abstract
In this paper, we show that the complete symmetric directed graph with n vertices K n ∗ admits an almost resolvable decomposition into TT 3 (the transitive tournament on 3 vertices) or C 3 (the directed cycle of length 3) if and only if n ≡ 1( mod 3).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
