Exploració per tema "Complete graphs"
Ara es mostren els items 1-2 de 2
-
Almost every tree with m edges decomposes K2m,2m
(2014-01)
Article
Accés obertWe show that asymptotically almost surely a tree with m edges decomposes the complete bipartite graph K2m,2m, a result connected to a conjecture of Graham and Häggkvist. The result also implies that asymptotically almost ... -
On the vulnerability of some families of graphs
(Iniciativa Digital Politècnica, 2011)
Text en actes de congrés
Accés obertThe toughness of a noncomplete graph G is defined as τ (G) = min{|S|/ω(G − S)}, where the minimum is taken over all cutsets S of vertices of G and ω(G − S) denotes the number of components of the resultant graph G − S by ...
