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

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


Efficient sets in graphs
โœ P.J. Bernhard; S.T. Hedetniemi; D.P. Jacobs ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 625 KB
Tutte sets in graphs I: Maximal tutte se
โœ D. Bauer; H. J. Broersma; A. Morgana; E. Schmeichel ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 177 KB

## 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

Independent sets in regular graphs
โœ M. Rosenfeld ๐Ÿ“‚ Article ๐Ÿ“… 1964 ๐Ÿ› The Hebrew University Magnes Press ๐ŸŒ English โš– 449 KB
Nearly perfect sets in graphs
โœ Jean E. Dunbar; Frederick C. Harris Jr; Sandra M. Hedetniemi; Stephen T. Hedetni ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 871 KB

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

Domination alteration sets in graphs
โœ Douglas Bauer; Frank Harary; Juhani Nieminen; Charles L. Suffel ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 738 KB

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

Dominating Sets in Planar Graphs
โœ Lesley R. Matheson; Robert E. Tarjan ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 174 KB