Location of Repository

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:
oai:hrcak.srce.hr:772

Provided by:
Hrčak - Portal of scientific journals of Croatia

Downloaded from
http://hrcak.srce.hr/file/1503

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