Skip to search formSkip to main contentSkip to account menu

Graph toughness

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
The present paper investigates the effect of adding silica nanoparticles to an anhydride-cured epoxy polymer in bulk and when… 
Highly Cited
2009
Highly Cited
2009
Polydisperse, functionalized, chemically converted graphene (f-CCG) nanosheets, which can be homogeneously distributed into water… 
Highly Cited
2005
Highly Cited
2005
Epoxy/clay nanocomposites with a better exfoliated morphology have been successfully prepared using a so-called “slurry… 
Highly Cited
2003
Highly Cited
2003
Growth of (0001) facet-dominated, free-standing, piezoelectric zinc oxide (ZnO) nanostructures is challenged by the divergence of… 
Highly Cited
1990
Highly Cited
1990
A semi-infinite interface crack between two infinite isotropic elastic layers under general edge loading conditions is considered… 
Highly Cited
1989
Highly Cited
1989
The role Of matrix ductility on the toughenability and toughening mechanism of elastomer-modified, diglycidyl ether of bisphenol… 
Highly Cited
1983
Highly Cited
1983
Experiments were performed on three heats of A508 class 3 steel in order to determine the mechanical conditions for cleavage…