Packing Parameters in Graphs
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 p...
Guardat en:
| Autors principals: | , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
University of Zielona Góra
2015-02-01
|
| Col·lecció: | Discussiones Mathematicae Graph Theory |
| Matèries: | |
| Accés en línia: | https://doi.org/10.7151/dmgt.1775 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|