๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Characterization of the (Natural) Graph Properties Testable with One-Sided Error

โœ Scribed by Alon, Noga; Shapira, Asaf

Book ID
118180728
Publisher
Society for Industrial and Applied Mathematics
Year
2008
Tongue
English
Weight
277 KB
Volume
37
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Some results on characterizing the edges
Some results on characterizing the edges of connected graphs with a given domination number
โœ Laura A. Sanchis ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 821 KB

A dominatin# set for a graph G = (V, E) is a subset of vertices V' c\_ V such that for all v โ€ข V-V' there exists some uโ€ข V' for which {v,u} โ€ขE. The domination number of G is the size of its smallest dominating set(s). For a given graph G with minimum size dominating set D, let mz(G, D) denote the nu

A Family of special outerplanar graphs w
A Family of special outerplanar graphs with only one triangle satisfying the cycle basis interpolation property
โœ Liu Yan ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 268 KB

The length of a cycle basis of a graph G is the sum of the lengths of its cycles. Let c-, c+ be the lengths of the minima1 and maxima1 cycle basis, respectively. Then G has the cycle basis interpolation property (chip) if for all integers c, c-< c < c+, there exists a cycle basis of length c. In thi