The toughness of a toroidal graph with connectivity 3 and girth 6 is exactly 1 (Q1889826): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Wei-Ting Cao / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Peter Horák / rank | |||
| Property / author | |||
| Property / author: Wei-Ting Cao / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Peter Horák / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00373-004-0558-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2004979475 / rank | |||
Normal rank | |||
Latest revision as of 22:56, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The toughness of a toroidal graph with connectivity 3 and girth 6 is exactly 1 |
scientific article |
Statements
The toughness of a toroidal graph with connectivity 3 and girth 6 is exactly 1 (English)
0 references
13 December 2004
0 references
The toughness of a graph \(G,t(G),\) is defined by \(t(G)=\min \{\left| S\right| /c(G-S)\},\) where the minimum runs over all cutsets \(S\) of \(G,\) and \(c(G-S)\) is the number of components of \(G-S.\) The authors show that every \(3\)-connected graph of girth \(6,\) which can be embedded in the torus, has toughness exactly \(1.\)
0 references
toughness
0 references
toroidal graph
0 references
