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

Maximum internally stable sets of a graph

โœ Scribed by S.L Hakimi; H Frank

Publisher
Elsevier Science
Year
1969
Tongue
English
Weight
711 KB
Volume
25
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Algorithms for a maximum clique and a ma
Algorithms for a maximum clique and a maximum independent set of a circle graph
โœ F. Gavril ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 523 KB

## Abstract Consider a family of chords in a circle. A circle graph is obtained by representing each chord by a vertex, two vertices being connected by an edge when the corresponding chords intersect. In this paper, we describe efficient algorithms for finding a maximum clique and a maximum indepen

The Cardinality of the Collection of Max
The Cardinality of the Collection of Maximum Independent Sets of a Functional Graph
โœ Shu-Chu Chang; Yeong-Nan Yeh ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 226 KB

An independent set or stable set of a graph G V, E is a subset S of the ลฝ . vertices set V in which no two are adjacent. Let G be the number of vertices in ลฝ . a stable set of maximum cardinality; G is called the stability number of G. Stability numbers of a graph have been well studied, but little

Graphs with unique minimum edge dominati
Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices
โœ Jerzy Topp ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 816 KB

Topp, J., Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices, Discrete Mathematics 12 1 (1993) 199-210. A set I of vertices of a graph G is an independent set if no two vertices of I are adjacent. A set M of edges of G is an edge dominating s