Some results on the independence number of connected domination critical graphs
A --critical graph is a graph with connected domination number and for any pair of non-adjacent vertices and of . Let and be respectively the clique number and the independence number of a graph. In this paper, we prove that every --critical graph satisfies for . We also characterize all --critical...
Na minha lista:
| Principais autores: | , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Taylor & Francis Group
2018-08-01
|
| coleção: | AKCE International Journal of Graphs and Combinatorics |
| Assuntos: | |
| Acesso em linha: | http://dx.doi.org/10.1016/j.akcej.2017.09.004 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|