Upper bounds on the bondage number of a graph
The bondage number b(G) of a graph G is the smallest number of edges whose removal from G results in a graph with larger domination number. We obtain sufficient conditions for the validity of the inequality b(G) ≤ 2s − 2, provided G has degree s vertices. We also present upper bounds for the bondage...
Na minha lista:
| Autor principal: | |
|---|---|
| Formato: | EJournal Article |
| Publicado em: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2018-04-03.
|
| Assuntos: | |
| Acesso em linha: | Get Fulltext |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|
Internet
Get Fulltext3rd Floor Main Library
| Área/Cota: |
A1234.567 |
|---|---|
| Cód. Barras: 1 | Disponível |