Abstract
We study the pseudo-one-factorization of regular graphs of odd order. It is shown that some classes of products (including composition and cartesian product) of graphs are pseudo-one- factorizable. In particular, we prove that a complete regular t-partite graph of odd order has this property.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have