Unicyclic graphs with equal domination and complementary tree domination numbers



Document title: Unicyclic graphs with equal domination and complementary tree domination numbers
Journal: Proyecciones (Antofagasta)
Database: PERIÓDICA
System number: 000406109
ISSN: 0716-0917
Authors: 1
1
Institutions: 1Shanmugha Arts, Science, Technology and Research Academy, School of Humanities and Sciences, Thanjavur, Tamil Nadu. India
Year:
Season: Sep
Volumen: 35
Number: 3
Pages: 245-249
Country: Chile
Language: Inglés
Document type: Artículo
Approach: Analítico
English abstract Let G = (V, E) be a simple graph. A set D ⊆ V (G) is a dominating set if every vertex in V (G) \ D is adjacent to a vertex of D. A dominating set D of a graph G is a complementary tree dominating set if induced sub graph V \ D is a tree. The domination (complementary tree domination, respectively) number of G is the minimum cardinality of a dominating (complementary tree dominating, respectively) set of G. We characterize all unicyclic graphs with equal domination and complementary tree domination numbers
Disciplines: Matemáticas
Keyword: Matemáticas aplicadas,
Matemáticas puras,
Combinatoria,
Teoría de gráficas,
Conjuntos dominantes,
Gráficas unicíclicas
Keyword: Mathematics,
Applied mathematics,
Pure mathematics,
Combinatorics,
Graph theory,
Dominating sets,
Unicyclic graphs
Full text: Texto completo (Ver PDF)