The Connectivity Of Domination Dot-Critical Graphs With No Critical Vertices
An edge of a graph is called dot-critical if its contraction decreases the domination number. A graph is said to be dot-critical if all of its edges are dot-critical. A vertex of a graph is called critical if its deletion decreases the domination number.
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Zielona Góra
2014-11-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.1752 |
| _version_ | 1797713153623064576 |
|---|---|
| author | Furuya Michitaka |
| author_facet | Furuya Michitaka |
| author_sort | Furuya Michitaka |
| collection | DOAJ |
| description | An edge of a graph is called dot-critical if its contraction decreases the domination number. A graph is said to be dot-critical if all of its edges are dot-critical. A vertex of a graph is called critical if its deletion decreases the domination number. |
| first_indexed | 2024-03-12T07:32:34Z |
| format | Article |
| id | doaj.art-7a6cc98ff12549f9af71bb65f4d60ae5 |
| institution | Directory Open Access Journal |
| issn | 2083-5892 |
| language | English |
| last_indexed | 2024-03-12T07:32:34Z |
| publishDate | 2014-11-01 |
| publisher | University of Zielona Góra |
| record_format | Article |
| series | Discussiones Mathematicae Graph Theory |
| spelling | doaj.art-7a6cc98ff12549f9af71bb65f4d60ae52023-09-02T21:43:02ZengUniversity of Zielona GóraDiscussiones Mathematicae Graph Theory2083-58922014-11-0134468369010.7151/dmgt.1752dmgt.1752The Connectivity Of Domination Dot-Critical Graphs With No Critical VerticesFuruya Michitaka0Department of Mathematical Information Science, Tokyo University of Science, 1-3 Kagurazaka, Shinjuku-ku, TokyoAn edge of a graph is called dot-critical if its contraction decreases the domination number. A graph is said to be dot-critical if all of its edges are dot-critical. A vertex of a graph is called critical if its deletion decreases the domination number.https://doi.org/10.7151/dmgt.1752dot-critical graphcritical vertexconnectivity. |
| spellingShingle | Furuya Michitaka The Connectivity Of Domination Dot-Critical Graphs With No Critical Vertices Discussiones Mathematicae Graph Theory dot-critical graph critical vertex connectivity. |
| title | The Connectivity Of Domination Dot-Critical Graphs With No Critical Vertices |
| title_full | The Connectivity Of Domination Dot-Critical Graphs With No Critical Vertices |
| title_fullStr | The Connectivity Of Domination Dot-Critical Graphs With No Critical Vertices |
| title_full_unstemmed | The Connectivity Of Domination Dot-Critical Graphs With No Critical Vertices |
| title_short | The Connectivity Of Domination Dot-Critical Graphs With No Critical Vertices |
| title_sort | connectivity of domination dot critical graphs with no critical vertices |
| topic | dot-critical graph critical vertex connectivity. |
| url | https://doi.org/10.7151/dmgt.1752 |
| work_keys_str_mv | AT furuyamichitaka theconnectivityofdominationdotcriticalgraphswithnocriticalvertices AT furuyamichitaka connectivityofdominationdotcriticalgraphswithnocriticalvertices |