(Open) packing number of some graph products
The packing number of a graph $G$ is the maximum number of closed neighborhoods of vertices in $G$ with pairwise empty intersections. Similarly, the open packing number of $G$ is the maximum number of open neighborhoods in $G$ with pairwise empty intersections. We consider the packing and open packi...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2020-08-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/5100/pdf |