Hamiltonicity of connected domination critical graphs
© 2018 Charles Babbage Research Centre. All rights reserved. A graph G is said to be k-yc-critical if the connected domination number yc(G) of G is k and yc(G + uv) < k for every uv ? E(G). The problem of interest for a positive integer I > 2 is to determine whether or not l-connect...
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Published: |
Charles Babbage
2018
|
| Online Access: | http://hdl.handle.net/20.500.11937/68952 |