5 research outputs found
Determinants of Box Products of Paths
Suppose that G is the graph obtained by taking the box product of a path of
length n and a path of length m. Let M be the adjacency matrix of G. If n=m,
H.M. Rara showed in 1996 that det(M)=0. We extend this result to allow n and m
to be any positive integers, and show that, if gcd(n+1,m+1)>1, then det(M)=0;
otherwise, if gcd(n+1,m+1)=1, then det(M)=(-1)^(nm/2)
Embeddings of One-Factorizations of Hypergraphs and Decompositions of Partitions
We look at one-factorizations of complete k-uniform hypergraphs, and investigate the problem of determining when, for U a subset of V, one can embed a one-factorization of the complete k-uniform hypergraph on U in a one-factorization of the complete k-uniform hypergraph on V. We give a brief history of the problem, and find our own independent results for specific values of k and v = |V|, in the process making explicit a theorem implicitly used by Haggkvist and Hellgren in their solution to the problem in general. We provide our own independent proof of this theorem, and subsequently use it to extend our results to certain nonuniform hypergraphs. This, in particular, allows us to find alternate proofs about two results involving the extension of symmetric Latin squares, originally shown by Cruse and by Hoffman. We then explain the connection between the hypergraph-embedding problem and a problem involving the decomposition of partitions of an integer N into subpartitions of an integer n, where n divides N. This in turn leads to a problem involving the cone generated by a subset V of R^n, the properties of which we investigate thoroughly
Abstract Central Groupoids, Central Digraphs,
We study central groupoids, central digraphs, and zero-one matrices A satisfying A 2 = J. A survey of known results is given, including short proofs for some of them; new results and techniques are developed, and conjectures are settled. Open questions and new conjectures are mentioned