Edinah K. Gnang

activity

20102025

most citedA Spectral Theory for Tensors

8 citations · 19 across the 32 of their papers we have counts for

collaborators

Showing math.COShow all

18 papers · 1 filter

math.CO2025

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 $n$ . We ado…

math.CO2024

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 $T_{1}, \dots, T_{n}$ where each $T_{k}$ has $k$ vertices packs into $K_{n}$ . We do so by translating the…

math.CO2024

Every tree on $n$ edges decomposes $K_{n x, n x}$ and $K_{2 n x + 1}$

Parikshit Chalise, Antwan Clark, Edinah K. Gnang

We prove that every tree on $n$ edges decomposes $K_{n x, n x}$ and $K_{2 n x + 1}$ for all positive integers $x$ . The said decompositions are obtained by proving that every tree admits…

math.CO2023

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…

math.CO2022

A proof of the Kotzig-Ringel-Rosa Conjecture

Edinah K. Gnang

In graph theory, a graceful labeling of a graph with m edges is a labeling of its vertices with a subset of the integers ranging from 0 to m inclusive, such that no two vertices sh…

math.CO2022

A proof of the Graham Sloane conjecture

Edinah K. Gnang, Michael Peretzian Williams

We settle in the affirmative the Graham-Sloane conjecture.