Uniform (Ck, Pk+1)-Factorizations of Kn − I When k Is Even

Mathematics

Salvatore Milici¹  Antoinette Tripodi²  Giovanni Lo Faro² 

[1] Dipartimento di Matematica e Informatica, Università di Catania, 95125 Catania, Italy;Dipartimento di Scienze Matematiche e Informatiche, Scienze Fisiche e Scienze della Terra, Università di Messina, 98166 Messina, Italy;

关键词: graph factorization;    complete graph;    block design;   

DOI  :  10.3390/math10060936

来源: DOAJ

【 摘 要 】

Let H be a connected subgraph of a graph G. An H-factor of G is a spanning subgraph of G whose components are isomorphic to H. Given a set $\mathcal{H}$ of mutually non-isomorphic graphs, a uniform $\mathcal{H}$-factorization of G is a partition of the edges of G into H-factors for some $H\in \mathcal{H}$. In this article, we give a complete solution to the existence problem for uniform $(C_k,P_{k+1})$-factorizations of $K_n-I$ in the case when k is even.

【 授权许可】

Unknown