Skoči na glavni sadržaj

Izvorni znanstveni članak

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

D. Vukičević


Puni tekst: engleski pdf 249 Kb

str. 123-142

preuzimanja: 792

citiraj


Sažetak

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.\]

Ključne riječi

factorization; decomposition; graph

Hrčak ID:

772

URI

https://hrcak.srce.hr/772

Datum izdavanja:

17.12.2002.

Posjeta: 1.476 *