Hao Yu

collaborators

3 papers

math.CO2026

Characterizing Finite Groups via Subgroup Perfect Codes

Binbin Li, Jingjian Li, Wei Meng +1

A perfect code in a graph $I^ = (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V ∖ C$ is adjacent to exactly one vertex in…

math.CO2026

Isomorphism factorizations of the complete graph into Cayley graphs on CI-groups

Huye Chen, Jingjian Li, Hao Yu +1

Isomorphic factorizations of complete graphs originate from the seminal work of Frank Harary and collaborators, who initiated the systematic study of decompositions of complete gra…

math.CO2024

On Hamilton paths in vertex-transitive graphs of order $10 p$

Shaofei Du, Wenjuan Luo, Hao Yu

It was shown by Kutnar, Maru\v si\v c and Zhang in 2012 that every connected vertex-transitive graph of order $10 p$ , where $p$ is a prime and $p \neq = 7$ , contains a Hamilton path, ex…

Characterizing Finite Groups via Subgroup Perfect Codes

Isomorphism factorizations of the complete graph into Cayley graphs on CI-groups

On Hamilton paths in vertex-transitive graphs of order 10p

On Hamilton paths in vertex-transitive graphs of order $10 p$