Covering and 2-degree-packing numbers in graphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2017
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866929615545565184 |
|---|---|
| author | Montufar, Carlos Alfaro Montiel, Christian Rubio Vázquez-Ávila, Adrián |
| author_facet | Montufar, Carlos Alfaro Montiel, Christian Rubio Vázquez-Ávila, Adrián |
| contents | In this paper, we give a relationship between the covering number of a simple graph $G$, $β(G)$, and a new parameter associated to $G$ which is called 2-degree-packing number of $G$, $ν_2(G)$. We prove that$$\lceil ν_{2}(G)/2\rceil\leqβ(G)\leqν_2(G)-1,$$ for any connected simple graph $G$, with $|E(G)|>ν_2(G)$, and we give a characterization of simple connected graphs which attains the inequalities. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1707_02254 |
| institution | arXiv |
| publishDate | 2017 |
| record_format | arxiv |
| spellingShingle | Covering and 2-degree-packing numbers in graphs Montufar, Carlos Alfaro Montiel, Christian Rubio Vázquez-Ávila, Adrián Combinatorics In this paper, we give a relationship between the covering number of a simple graph $G$, $β(G)$, and a new parameter associated to $G$ which is called 2-degree-packing number of $G$, $ν_2(G)$. We prove that$$\lceil ν_{2}(G)/2\rceil\leqβ(G)\leqν_2(G)-1,$$ for any connected simple graph $G$, with $|E(G)|>ν_2(G)$, and we give a characterization of simple connected graphs which attains the inequalities. |
| title | Covering and 2-degree-packing numbers in graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/1707.02254 |