Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Graph_toughness> ?p ?o. }
Showing items 1 to 30 of
30
with 100 items per page.
- Graph_toughness abstract "In graph theory, toughness is a measure of the connectivity of a graph. A graph G is said to be t-tough for a given real number t if, for every integer k > 1, G cannot be split into k different connected components by the removal of fewer than tk vertices. For instance, a graph is 1-tough if the number of components formed by removing a set of vertices is always at most as large as the number of removed vertices. The toughness of a graph is the maximum t for which it is t-tough; this is a finite number for all graphs except the complete graphs, which by convention have infinite toughness.Graph toughness was first introduced by Václav Chvátal (1973). Since then there has been extensive work by other mathematicians on toughness; the recent survey by Bauer, Broersma & Schmiechel (2006) lists 99 theorems and 162 papers on the subject.".
- Graph_toughness thumbnail Graph_toughness.svg?width=300.
- Graph_toughness wikiPageID "8839340".
- Graph_toughness wikiPageRevisionID "591621028".
- Graph_toughness authorlink "Václav Chvátal".
- Graph_toughness first "Václav".
- Graph_toughness hasPhotoCollection Graph_toughness.
- Graph_toughness last "Chvátal".
- Graph_toughness year "1973".
- Graph_toughness subject Category:Graph_connectivity.
- Graph_toughness subject Category:Graph_invariants.
- Graph_toughness type Abstraction100002137.
- Graph_toughness type Cognition100023271.
- Graph_toughness type Concept105835747.
- Graph_toughness type Content105809192.
- Graph_toughness type Feature105849789.
- Graph_toughness type GraphInvariants.
- Graph_toughness type Idea105833840.
- Graph_toughness type Invariant105850432.
- Graph_toughness type Property105849040.
- Graph_toughness type PsychologicalFeature100023100.
- Graph_toughness comment "In graph theory, toughness is a measure of the connectivity of a graph. A graph G is said to be t-tough for a given real number t if, for every integer k > 1, G cannot be split into k different connected components by the removal of fewer than tk vertices. For instance, a graph is 1-tough if the number of components formed by removing a set of vertices is always at most as large as the number of removed vertices.".
- Graph_toughness label "Graph toughness".
- Graph_toughness sameAs m.027lkrb.
- Graph_toughness sameAs Q5597099.
- Graph_toughness sameAs Q5597099.
- Graph_toughness sameAs Graph_toughness.
- Graph_toughness wasDerivedFrom Graph_toughness?oldid=591621028.
- Graph_toughness depiction Graph_toughness.svg.
- Graph_toughness isPrimaryTopicOf Graph_toughness.
