Abstract
A very natural question raised about products of graphs is the following. Do there exist necessary and sufficient conditions on a pair (G,H) of graphs for their product to have some specified property? In particular, for which graphs is the product one-factorizable? Sufficient conditions have been investigated for the cartesian, lexicographic, and tensor products in [3], [4], and [5]. However, the conditions for the tensor product to be one-factorizable are significantly more scanty than those for the other products. The purpose of this paper is to correct this situation somewhat.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.