Abstract
F. Harary, R.W. Robinson and N.C. Wormald studied a complete tripartite graph K(m, n, s), and putted forward the conjecture, for t|(mn + ms + ns), t > 1 and t is even, then G has a t isomorphic factorization subgraphs. For t divides mn + ms + ns and t = 2, 4, they obtained that then G has a t isomorphic factorization subgraphs. In this paper, we used the decomposition and Congruential method and obtained the conjecture is true for t = 20.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
