## Hamiltonicity of connected domination critical graphs

dc.contributor.author | Kaemawichanurat, P. | |

dc.contributor.author | Caccetta, Louis | |

dc.contributor.author | Ananchuen, W. | |

dc.date.accessioned | 2018-06-29T12:27:52Z | |

dc.date.available | 2018-06-29T12:27:52Z | |

dc.date.created | 2018-06-29T12:08:48Z | |

dc.date.issued | 2018 | |

dc.identifier.citation | Kaemawichanurat, P. and Caccetta, L. and Ananchuen, W. 2018. Hamiltonicity of connected domination critical graphs. Ars Combinatoria. 136: pp. 127-151. | |

dc.identifier.uri | http://hdl.handle.net/20.500.11937/68952 | |

dc.description.abstract |
© 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-connected k-yc-critical graphs are Hamiltonian. In this paper, for I > 2, we prove that if k - 1,2 or 3, then every l-connected k-yc-critical graph is Hamiltonian. We further show that, for n > (k - 1)k + 3, the class of i-connected Jt-yc-critical non-Hamiltonian graphs of order n is empty if and only if k = 1,2 or 3. | |

dc.publisher | Charles Babbage | |

dc.title | Hamiltonicity of connected domination critical graphs | |

dc.type | Journal Article | |

dcterms.source.volume | 136 | |

dcterms.source.startPage | 127 | |

dcterms.source.endPage | 151 | |

dcterms.source.issn | 0381-7032 | |

dcterms.source.title | Ars Combinatoria | |

curtin.department | School of Electrical Engineering, Computing and Mathematical Science (EECMS) | |

curtin.accessStatus | Fulltext not available |

## Files in this item

Files | Size | Format | View |
---|---|---|---|

There are no files associated with this item. |