Premium
The number of bipartite tournaments with a unique given factor
Author(s) -
Manolis Manoussakis,
Yannis Manoussakis
Publication year - 1989
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.3190130311
Subject(s) - bipartite graph , mathematics , combinatorics , complete bipartite graph , hamiltonian path , edge transitive graph , discrete mathematics , graph , voltage graph , line graph
Abstract We give a recursive function in order to calculate the number of all non‐isomorphic bipartite tournaments containing an unique hamiltonian cycle. Using this result we determine the number of all nonisomorphic bipartite tournaments that admit an unique factor isomorphic to a given 1‐diregu‐lar bipartite graph.