- Tytuł:
- Packing Parameters in Graphs
- Autorzy:
-
Sahul Hamid, I.
Saravanakumar, S. - Powiązania:
- https://bibliotekanauki.pl/articles/31232984.pdf
- Data publikacji:
- 2015-02-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
packing number
open packing number - Opis:
- 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 $ρ^L_o$ and $ρ^o$. In this paper, we present some bounds on these parameters.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2015, 35, 1; 5-16
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł