8 citations · 19 across the 32 of their papers we have counts for
34 papers
Two Proofs of the Hamiltonian Cycle Identity
Hamilton Sawczuk, Edinah Gnang
The Hamiltonian cycle polynomial can be evaluated to count the number of Hamiltonian cycles in a graph. It can also be viewed as a list of all spanning cycles of length . We ado…
A Proof of the Tree Packing Conjecture
Parikshit Chalise, Antwan Clark, Edinah K. Gnang
We prove a conjecture of Gyárfás (1976), which asserts that any family of trees where each has vertices packs into . We do so by translating the…
Every tree on edges decomposes and
Parikshit Chalise, Antwan Clark, Edinah K. Gnang
We prove that every tree on edges decomposes and for all positive integers . The said decompositions are obtained by proving that every tree admits…
Symbolic Listings as Computation
Hamilton Sawczuk, Edinah Gnang
We propose an algebraic model of computation which formally relates symbolic listings, complexity of Boolean functions, and low depth arithmetic circuit complexity. In this model a…
On the Chow-rank of the permanent
Rongyu Xu, Edinah Gnang
We derive Glynn's formula from Ryser's formula for the permanent. We further establish via an orbital argument that Glynn's formula yields an optimal row-homogeneous Chow-decomposi…
Apportionable matrices and gracefully labelled graphs
Antwan Clark, Bryan A. Curtis, Edinah K. Gnang +1
To apportion a complex matrix means to apply a similarity so that all entries of the resulting matrix have the same magnitude. We initiate the study of apportionment, both by unita…