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...
| Váldodahkkit: | , , , |
|---|---|
| Materiálatiipa: | Artihkal |
| Giella: | English |
| Almmustuhtton: |
Frontiers Media S.A.
2022-10-01
|
| Ráidu: | Frontiers in Computational Neuroscience |
| Fáttát: | |
| Liŋkkat: | https://www.frontiersin.org/articles/10.3389/fncom.2022.1019039/full |