Skip to main content
Article thumbnail
Location of Repository

Factorizations of the complete graphs into factor of subdiameter two and factors of diameter three

By D. Vukičević


We search for the minimal number of vertices of the complete graph that can be decomposed into one factor of subdiameter 2 and k factors of diameter 3. We find as follows: exact values for k≤3, upper and lower bounds for small values of k and [lim_{krightarrow infty }frac{phi left( kright) }{k}=2.

Topics: factorization; decomposition; graph
Publisher: Department of Mathematics, University of Osijek
Year: 2002
OAI identifier:

Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.