Cargando…
Some sufficient conditions on hamilton graphs with toughness
Let G be a graph, and the number of components of G is denoted by c(G). Let t be a positive real number. A connected graph G is t-tough if tc(G − S) ≤ |S| for every vertex cut S of V(G). The toughness of G is the largest value of t for which G is t-tough, denoted by τ(G). We call a graph G Hamiltoni...
| Autores principales: | , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Frontiers Media S.A.
2022
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9614090/ https://www.ncbi.nlm.nih.gov/pubmed/36313815 http://dx.doi.org/10.3389/fncom.2022.1019039 |