Abstract

A nonempty subset of the edge set of a graph $G$ is called an edge open packing set if no two edges of it have a common edge. The edge open packing number $\rho_e^o(G)$ of a graph $G$ is the maximum number of edges in an edge open packing set. In this paper, a number of results are presented concerning lower and upper bounds of $\rho_e^o(G)$ for graphs such as trees, split graphs and unicyclic graphs. Some open problems are proposed.

Keywords and Phrases

Open packing number, edge open packing number, split graphs, unicyclic graphs.

A.M.S. subject classification

05C12, 05C70, 05C75.

.....