Abstract
AbstractFor the class of 2‐diregular digraphs: (1) We give a simple closed form expression—a power of 2—for the number of difactors. (2) For the adjacency matrices of these graphs, we show an intimate relationship between the permanent and determinant. (3) We give a necessary and sufficient condition for the Cartesian product of two directed circuits to have a difactor with exactly k components thereby generalizing a result of Trotter and Erdöos. Our results also show that a conjecture of Bondy, regarding vertex‐transitive graphs, fails to hold for vertex‐transitive digraphs.
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.
