Maximum packings of Kn with copies of K4-e.

C.C. Lindner; D.G. Hoffman; M. Sharry

Displaying similar documents to “Maximum packings of Kn with copies of K4-e.”

The Disk-Packing Constant

DAVID W. BOYD (1971)

Aequationes mathematicae

Similarity:

Orthogonal packings in PG(5, 2).

D.R. Stinson, S.A. Vanstone (1986)

Aequationes mathematicae

Similarity:

Improved Bounds for the Disk-packing Constant

DAVID W. BOYD (1973)

Aequationes mathematicae

Similarity:

Packing Parameters in Graphs

I. Sahul Hamid, S. Saravanakumar (2015)

Discussiones Mathematicae Graph Theory

Similarity:

In a graph G = (V,E), a non-empty set S ⊆ V is said to be an open packing set if no two vertices of S have a common neighbour in G. An open packing set which is not a proper subset of any open packing set is called a maximal open packing set. The minimum and maximum cardinalities of a maximal open packing set are respectively called the lower open packing number and the open packing number and are denoted by ρoL and ρo. In this paper, we present some bounds on these parameters. ...