Original scientific paper
Factorizations of the complete graphs into factor of subdiameter two and factors of diameter three
D. Vukičević
Abstract
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_{k\rightarrow \infty }\frac{\phi \left( k\right) }{k}=2.\]
Keywords
factorization; decomposition; graph
Hrčak ID:
772
URI
Publication date:
17.12.2002.
Visits: 1.455 *