The second largest number of maximal independent sets in connected graphs with at most one cycle

2011 ◽  
Vol 24 (3) ◽  
pp. 192-201 ◽  
Author(s):  
Min-Jen Jou
Keyword(s):  
Independent Sets ◽  
Connected Graphs ◽  
Maximal Independent Sets

scholarly journals The maximum number of maximal independent sets in unicyclic connected graphs

2008 ◽  
Vol 308 (17) ◽  
pp. 3761-3769 ◽  
Author(s):  
K.M. Koh ◽  
C.Y. Goh ◽  
F.M. Dong
Keyword(s):  
Independent Sets ◽  
Connected Graphs ◽  
Maximal Independent Sets

Trees without twin-leaves with smallest number of maximal independent sets

2020 ◽  
Vol 30 (1) ◽  
pp. 53-67 ◽  
Author(s):  
Dmitriy S. Taletskii ◽  
Dmitriy S. Malyshev
Keyword(s):  
Independent Sets ◽  
Adjacent Vertex ◽  
Maximal Independent Sets

AbstractFor any n, in the set of n-vertex trees such that any two leaves have no common adjacent vertex, we describe the trees with the smallest number of maximal independent sets.

Independent sets in n-vertex k-chromatic ℓ-connected graphs

2021 ◽  
Vol 344 (7) ◽  
pp. 112376
Author(s):  
John Engbers ◽  
Lauren Keough ◽  
Taylor Short
Keyword(s):  
Independent Sets ◽  
Connected Graphs

On graphs with the third largest number of maximal independent sets

2009 ◽  
Vol 109 (4) ◽  
pp. 248-253 ◽  
Author(s):  
Hongbo Hua ◽  
Yaoping Hou
Keyword(s):  
Independent Sets ◽  
The Third ◽  
Maximal Independent Sets

scholarly journals Maximal independent sets on a grid graph

2017 ◽  
Vol 340 (12) ◽  
pp. 2762-2768 ◽  
Author(s):  
Seungsang Oh
Keyword(s):  
Independent Sets ◽  
Grid Graph ◽  
Maximal Independent Sets

Combinatorial aspects of the Löwenstein avoidance rule. Part I: the independence polynomial

2021 ◽  
Vol 77 (6) ◽  
Author(s):  
Montauban Moreira de Oliveira Jr ◽  
Jean-Guillaume Eon
Keyword(s):  
Propositional Calculus ◽  
Independent Sets ◽  
Companion Paper ◽  
Theoretical Interpretation ◽  
Vector Method ◽  
Independence Polynomial ◽  
Calculation Technique ◽  
Independence Polynomials ◽  
Maximal Independent Sets

According to Löwenstein's rule, Al–O–Al bridges are forbidden in the aluminosilicate framework of zeolites. A graph-theoretical interpretation of the rule, based on the concept of independent sets, was proposed earlier. It was shown that one can apply the vector method to the associated periodic net and define a maximal Al/(Al+Si) ratio for any aluminosilicate framework following the rule; this ratio was called the independence ratio of the net. According to this method, the determination of the independence ratio of a periodic net requires finding a subgroup of the translation group of the net for which the quotient graph and a fundamental transversal have the same independence ratio. This article and a companion paper deal with practical issues regarding the calculation of the independence ratio of mainly 2-periodic nets and the determination of site distributions realizing this ratio. The first paper describes a calculation technique based on propositional calculus and introduces a multivariate polynomial, called the independence polynomial. This polynomial can be calculated in an automatic way and provides the list of all maximal independent sets of the graph, hence also the value of its independence ratio. Some properties of this polynomial are discussed; the independence polynomials of some simple graphs, such as short paths or cycles, are determined as examples of calculation techniques. The method is also applied to the determination of the independence ratio of the 2-periodic net dhc.

Sign in / Sign up

Export Citation Format

Share Document