Another upper bound for the domination number of a graph
If δ and ∆ are the minimum and máximum degrees of a simple graph G of size n, then, for its domination number B(G), we show that B(G) ≤ [(n-∆-1) (n- δ-2)/(n-1)]+2.
- Autores:
-
Marcu, Danut
- Tipo de recurso:
- Article of journal
- Fecha de publicación:
- 1986
- Institución:
- Universidad Nacional de Colombia
- Repositorio:
- Universidad Nacional de Colombia
- Idioma:
- spa
- OAI Identifier:
- oai:repositorio.unal.edu.co:unal/48839
- Acceso en línea:
- https://repositorio.unal.edu.co/handle/unal/48839
http://bdigital.unal.edu.co/42296/
- Palabra clave:
- Upper limit
number of domination graph
- Rights
- openAccess
- License
- Atribución-NoComercial 4.0 Internacional
| Summary: | If δ and ∆ are the minimum and máximum degrees of a simple graph G of size n, then, for its domination number B(G), we show that B(G) ≤ [(n-∆-1) (n- δ-2)/(n-1)]+2. |
|---|