Premium
Factors in a class of regular digraphs
Author(s) -
Ramanath M. V. S.
Publication year - 1985
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190090113
Subject(s) - mathematics , combinatorics , cartesian product , transitive relation , vertex (graph theory) , conjecture , adjacency list , discrete mathematics , class (philosophy) , digraph , graph , computer science , artificial intelligence
For 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.