Structural Properties of Connected Domination Critical Graphs
A graph <i>G</i> is said to be <i>k</i>-<inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mi>γ</mi><mi>c</mi></msub></semantics></math></...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-10-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/9/20/2568 |