In this paper we give a complete solution of the maximum packing problem for K(v) with copies of a graph G having at least one vertex of degree one and such that E(G) = V(G) = 5, for all v >= 7 and for all possible leaves.
A note to maximum packings of K(v) with a graph G of five vertices and five edges
MILICI, Salvatore
2005-01-01
Abstract
In this paper we give a complete solution of the maximum packing problem for K(v) with copies of a graph G having at least one vertex of degree one and such that E(G) = V(G) = 5, for all v >= 7 and for all possible leaves.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
