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

Graphs with unique maximum independent sets

โœ Scribed by Glenn Hopkins; William Staton

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
402 KB
Volume
57
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

On unique independent sets in graphs
On unique independent sets in graphs
โœ Werner Siemes; Jerzy Topp; Lutz Volkmann ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 483 KB
Maximal and maximum independent sets in
Maximal and maximum independent sets in graphs with at most r cycles
โœ Bruce E. Sagan; Vincent R. Vatter ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 236 KB ๐Ÿ‘ 2 views

## Abstract Let __m__(__G__) denote the number of maximal independent sets of vertices in a graph __G__ and let __c__(__n__,__r__) be the maximum value of __m__(__G__) over all connected graphs with __n__ vertices and at most __r__ cycles. A theorem of Griggs, Grinstead, and Guichard gives a formul

Independent sets in graphs with triangle
Independent sets in graphs with triangles
โœ Thomas Hofmeister; Hanno Lefmann ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 387 KB