Vertex domination-critical graphs
| Autor: | Phyllis Zweig Chinn, Robert C. Brigham, Ronald D. Dutton |
|---|---|
| Rok vydání: | 1988 |
| Předmět: |
Discrete mathematics
Computer Networks and Communications Domination analysis Neighbourhood (graph theory) Vertex (geometry) Combinatorics Pathwidth Circulant graph Computer Science::Discrete Mathematics Hardware and Architecture Dominating set Independent set Bipartite graph Software Information Systems Mathematics |
| Zdroj: | Networks. 18:173-179 |
| ISSN: | 1097-0037 0028-3045 |
| DOI: | 10.1002/net.3230180304 |
| Popis: | A dominating set in a graph G is a set of vertices D such that every vertex of G is either in D or is adjacent some vertex of D. The domination number Γ(G) of G is the minimum cardinality of any dominating set. A graph is vertex domination-critical if the removal of any vertex decreases its domination number. This paper gives examples and properties of vertex domination-critical graphs, presents a method of constructing them, and poses some open questions. In the process several results for arbitrary graphs are presented. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Plný text