F-Sets in graphs
โ Scribed by V Krishnamoorthy; K.R Parthasarathy
- Book ID
- 107884093
- Publisher
- Elsevier Science
- Year
- 1978
- Tongue
- English
- Weight
- 453 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract A wellโknown formula of Tutte and Berge expresses the size of a maximum matching in a graph __G__ in terms of what is usually called the deficiency of __G__. A subset __X__ of __V__(__G__) for which this deficiency is attained is called a Tutte set of __G__. While much is known about ma
In a graph G = (V, E), a set of vertices S is nearly perfect if every vertex in V-S is adjacent to at most one vertex in S. Nearly perfect sets are closely related to 2-packings of graphs, strongly stable sets, dominating sets and efficient dominating sets. We say a nearly perfect set S is 1-minimal
The domination number a(G) of a graph G is the size of a minimum dominating set, i.e., a set of points with the property that every other point is adjacent to a point of the set. In general a(G) can be made to increase or decrease by the removal of points from G. Our main objective is the study of t