Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Erik Engbers"'
Publikováno v:
Networks, 33(33), 233-238. Wiley-Liss Inc.
University of Twente Research Information (Pure Portal)
University of Twente Research Information (Pure Portal)
Let G be a graph, and let t 0 be a real number. Then G is t-tough if t!(G − S) jSj for all S V (G) with !(G − S) > 1, where !(G − S) denotes the number of components of G − S. The toughness of G, denoted by (G), is the maximum value of t for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::452266d9466759043a30c95364952f2b
https://research.utwente.nl/en/publications/497d0139-ecea-4cf8-973c-fe8a6df1da45
https://research.utwente.nl/en/publications/497d0139-ecea-4cf8-973c-fe8a6df1da45
