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: | Kaemawichanurat, P., Caccetta, Louis, Ananchuen, W. |
|---|---|
| Format: | Journal Article |
| Published: |
Charles Babbage
2018
|
| Online Access: | http://hdl.handle.net/20.500.11937/68952 |
Similar Items
Critical graphs with respect to total domination and connected domination
by: Kaemawichanurat, P., et al.
Published: (2016)
by: Kaemawichanurat, P., et al.
Published: (2016)
Bounds on the order of connected domination vertex critical graphs
by: Kaemawichanurat, P., et al.
Published: (2018)
by: Kaemawichanurat, P., et al.
Published: (2018)
Connected Domination Critical Graphs
by: Kaemawichanurat, Pawaton
Published: (2015)
by: Kaemawichanurat, Pawaton
Published: (2015)
On minimum cutsets in independent domination vertex-critical graphs
by: Ananchuen, N., et al.
Published: (2018)
by: Ananchuen, N., et al.
Published: (2018)
A characterization of 3-i-critical graphs of connectivity two
by: Ananchuen, N., et al.
Published: (2017)
by: Ananchuen, N., et al.
Published: (2017)
A Characterization of 3-(γc, 2)-Critical Claw-Free Graphs Which are not 3-γc-Critical
by: Ananchuen, Watcharaphong, et al.
Published: (2010)
by: Ananchuen, Watcharaphong, et al.
Published: (2010)
Cubic and quadruple Paley graphs with the n-e.c. property
by: Ananchuen, Watcharaphong, et al.
Published: (2006)
by: Ananchuen, Watcharaphong, et al.
Published: (2006)
Graphs that are critical with respect to matching extension and diameter
by: Ananchuen, Nawarat
Published: (1994)
by: Ananchuen, Nawarat
Published: (1994)
Dominating Sets and Domination Polynomials of Graphs
by: Alikhani, Saeid
Published: (2009)
by: Alikhani, Saeid
Published: (2009)
On Hamilton cycles in regular graphs / Nor Nadia Zainal Abidin
by: Nor Nadia, Zainal Abidin
Published: (2017)
by: Nor Nadia, Zainal Abidin
Published: (2017)
On the domination number of some graphs.
by: Alikhani, Saeid, et al.
Published: (2008)
by: Alikhani, Saeid, et al.
Published: (2008)
Power Dominating Numbers In Graphs
by: Chan, Kar Man
Published: (2021)
by: Chan, Kar Man
Published: (2021)
Graphs with prescribed adjacency properties
by: Ananchuen, Watcharaphong
Published: (1993)
by: Ananchuen, Watcharaphong
Published: (1993)
Dominant mixed metric dimension of graph
by: Alfarisi, Ridho, et al.
Published: (2024)
by: Alfarisi, Ridho, et al.
Published: (2024)
Chromaticity of Certain 2-Connected Graphs
by: Lau, Gee Choon
Published: (2003)
by: Lau, Gee Choon
Published: (2003)
Single-row mapping and transformation of connected graphs
by: Salleh, Shaharuddin Hussain, et al.
Published: (2007)
by: Salleh, Shaharuddin Hussain, et al.
Published: (2007)
Hamilton-Jacobi-Bellman equations on time scales
by: Zhan, Z., et al.
Published: (2009)
by: Zhan, Z., et al.
Published: (2009)
On the Higher Order Edge-Connectivity of Complete Multipartite Graphs
by: Peng, Y. H., et al.
Published: (1989)
by: Peng, Y. H., et al.
Published: (1989)
Eccentric connectivity index of unicyclic graphs with application to cycloalkanes
by: Haoer, Raad Sehen, et al.
Published: (2015)
by: Haoer, Raad Sehen, et al.
Published: (2015)
Comparison between atom-bond connectivity indices of graphs
by: Das, Kinkar Ch., et al.
Published: (2016)
by: Das, Kinkar Ch., et al.
Published: (2016)
The Existence of Diameter-Edge-Critical Graphs
by: Almalki, Norah Saleh A
Published: (2016)
by: Almalki, Norah Saleh A
Published: (2016)
On the atom bond connectivity index of certain trees and unicyclic graphs
by: Mohammed, Mohanad Ali, et al.
Published: (2015)
by: Mohammed, Mohanad Ali, et al.
Published: (2015)
Atom bond connectivity index of molecular graphs of alkenes and cycloalkenes
by: Mohammed, Mohanad A., et al.
Published: (2017)
by: Mohammed, Mohanad A., et al.
Published: (2017)
The atom bond connectivity index of some trees and bicyclic graphs
by: Mohammed, Mohanad Ali, et al.
Published: (2015)
by: Mohammed, Mohanad Ali, et al.
Published: (2015)
Shenton Park Home, Hamilton Hill Home
by: Warn, Geoff
Published: (2008)
by: Warn, Geoff
Published: (2008)
A key-predistribution-based weakly connected dominating set for secure clustering in DSN
by: Pathan, Al-Sakib Khan, et al.
Published: (2006)
by: Pathan, Al-Sakib Khan, et al.
Published: (2006)
Weakly connected dominating set-based secure clustering and operation in distributed sensor networks
by: Pathan, Al-Sakib Khan, et al.
Published: (2009)
by: Pathan, Al-Sakib Khan, et al.
Published: (2009)
Efficient sensor position selection using graph connectivity / Firdawati Mohamed ...[et al.]
by: Mohamed, Firdawati, et al.
Published: (2018)
by: Mohamed, Firdawati, et al.
Published: (2018)
Linear-time heuristic partitioning technique for mapping
of connected graphs into single-row networks
by: Ser, Lee Loh, et al.
Published: (2014)
by: Ser, Lee Loh, et al.
Published: (2014)
Commuting graphs, C(G, X) in symmetric groups Sym(n) and its connectivity
by: Nawawi @ Mohamed Nawawi, Athirah, et al.
Published: (2019)
by: Nawawi @ Mohamed Nawawi, Athirah, et al.
Published: (2019)
Life history traits of the critically endangered catfish eutropiichthys vacha (Hamilton 1822) in the Jamuna (Brahmaputra River Distributary) River, Northern Bangladesh
by: Md. Yeamin Hossain,, et al.
Published: (2013)
by: Md. Yeamin Hossain,, et al.
Published: (2013)
Alliance size and airline performance / Robert T. Hamilton and Sussie C. Morrish
Published: (2005)
Published: (2005)
Threatened fishes of the world Pangasius pangasius
Hamilton-Buchanan, 1822 (Pangasiidae)
by: Hossain, Md. Yeamin, et al.
Published: (2009)
by: Hossain, Md. Yeamin, et al.
Published: (2009)
Dominating Sets and Domination Polynomials of Cycles
by: Alikhania, Saeid, et al.
Published: (2008)
by: Alikhania, Saeid, et al.
Published: (2008)
Every 3-connected claw-free b{i;7-i}-free graph is Hamiltonian
by: Saburov, Khikmat, et al.
Published: (2012)
by: Saburov, Khikmat, et al.
Published: (2012)
Every 3-connected claw-free B_{i;7-i}-free graph is Hamiltonian
by: Saburov, Khikmat, et al.
Published: (2012)
by: Saburov, Khikmat, et al.
Published: (2012)
The chromaticity of s-bridge graphs and related graphs
by: Xu, Shaoji, et al.
Published: (1994)
by: Xu, Shaoji, et al.
Published: (1994)
Unlinked Embedded Graphs
by: Barrett, John W.
Published: (2000)
by: Barrett, John W.
Published: (2000)
Numerical Solution of Hamilton-Jacobi-Bellman Equations by an Upwind Finite Volume Method
by: Wang, S., et al.
Published: (2003)
by: Wang, S., et al.
Published: (2003)
Connectivity and Critical Reading in the Late Age of Literature
by: Dolin, Tim
Published: (2015)
by: Dolin, Tim
Published: (2015)
Similar Items
-
Critical graphs with respect to total domination and connected domination
by: Kaemawichanurat, P., et al.
Published: (2016) -
Bounds on the order of connected domination vertex critical graphs
by: Kaemawichanurat, P., et al.
Published: (2018) -
Connected Domination Critical Graphs
by: Kaemawichanurat, Pawaton
Published: (2015) -
On minimum cutsets in independent domination vertex-critical graphs
by: Ananchuen, N., et al.
Published: (2018) -
A characterization of 3-i-critical graphs of connectivity two
by: Ananchuen, N., et al.
Published: (2017)