(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...
Na minha lista:
| Principais autores: | , , , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Discrete Mathematics & Theoretical Computer Science
2020-08-01
|
| Serier: | Discrete Mathematics & Theoretical Computer Science |
| Fag: | |
| Online adgang: | https://dmtcs.episciences.org/5100/pdf |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|