On the Decomposition of the Complete Directed Graph into Factors with Given Diameters
Eliška Tomová (1970)
Matematický časopis
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On a Certain Type of Decompositions of Complete Graphs into Factors with Equal Diameters”
On the Decomposition of the Complete Directed Graph into Factors with Given Diameters
On the decomposition of complete directed graphs into factors with given radii
Eliška Tomová (1986)
Mathematica Slovaca
Similarity:
Decomposition of complete bipartite graphs into factors with given radii
Eliška Tomová (1977)
Mathematica Slovaca
Similarity:
Decomposition of complete graphs into factors of diameter two and three
Damir Vukicević (2003)
Discussiones Mathematicae Graph Theory
Similarity:
We analyze a minimum number of vertices of a complete graph that can be decomposed into one factor of diameter 2 and k factors of diameter at most 3. We find exact values for k ≤ 4 and the asymptotic value of the ratio of this number and k when k tends to infinity. We also find the asymptotic value of the ratio of the number of vertices of the smallest complete graph that can be decomposed into p factors of diameter 2 and k factors of diameter 3 and number k when p is fixed. ...