maximal independent sets
An Alternative Proof of the Largest Number of Maximal Independent Sets in Connected Graphs Having at Most Two Cycles
... An independent set is a subset S of V such that no two vertices in S are ...A maximal independent set is an independent set that is not a proper subset of any other independent ...all ...
11
The Number of Maximal Independent Sets in Quasi Tree Graphs and Quasi Forest Graphs
... An independent set is a subset S of V such that no two vertices in S are ...A maximal independent set is an independent set that is not a proper subset of any other independent ...all ...
14
Eternal Independent Sets in Graphs
... all maximal independent sets have the same cardinality) have this property, since there exists a perfect matching between the vertices in the symmetric difference of any two maximal ...
12
The domination parameters of cubic graphs
... the independent domination number i(G) is the minimum cardinality taken over all maximal independent sets of ...dominating sets of ...
11
Matroids on domains of functions
... The maximal independent sets are known as bases and their size is the rank of the matroid.. This brings us to the next two axiomatic descriptions.[r] ...
88
The number of maximal sum free subsets of integers
... We remark that Lemma 2.4 was already essentially proven in [8] (without applying Lemma 2.3). Note that γ could be negative in Lemma 2.4. The upper bound 1/11 on γ here can be relaxed to any constant smaller than 1/10 ...
11
Compression methods for graph algorithms
... Running Time For Original and Modified Algorithms Versus Number of Maximal Independent Sets.. Time per Maximal Independent Set Versus Ratio of Procedure Calls For The Original Algorithm.[r] ...
229
Three questions of Bertram on locally maximal sum free sets
... locally maximal sum-free sets, and hence to find such partitions, it is useful to understand locally maximal sum-free ...locally maximal sum-free sets in groups of small orders, up to ...
7
Independent sets in vertex arrival streams
... Maximum Independent Set ( MIS ) is an important problem on ...maximum independent set in a general graph [16], and even hard to approximate within a factor of n 1− , for any > 0 ...
15
Randomised techniques in combinatorial algorithmics
... of maximal solution and, for the second problem, the use of a probabilistic model called the (young) coupon collector allows us to improve the best known results for these ...
151
Groups whose locally maximal product free sets are complete
... product-free sets S of size ...locally maximal product-free set and test whether each possible extension fills our group ...locally maximal and if not, we (recursively) extend this new ...locally ...
18
Vol 3, No 12 (2012)
... In Section 5, we prove fundamental properties of b- γ -radicals of maximal b- γ -open sets. We establish a very useful decomposition theorem for a maximal open set in Theorem 5.8. Theorem 5.8 will be ...
6
On Maximal and Minimal Fuzzy Sets in I Topological Spaces
... open sets to include I-topological spaces as follows; a fuzzy open set A of an I-topological space X, I is called minimal fuzzy open set 11 if A is nonzero and there is no nonzero proper fuzzy open subset of ...
11
Locally maximal product free sets of size 3
... locally maximal product-free sets of size 3 occurring in groups of order up to 24 (in fact, up to 37 in the original ...locally maximal product-free sets of size 3 occur in groups of order up ...
11
Groups containing small locally maximal product free sets
... product-free sets in groups of even ...the maximal size of a sum-free set in an arbitrary abelian ...locally maximal product- free ...locally maximal product-free set in a group of order n? A ...
9
Groups whose locally maximal product free sets are complete
... sum-free sets in the elementary abelian group of order 2 n correspond to complete caps in the projective space P G(n − 1, 2); that is, collections of points, maximal by inclusion, with no three ...
21
On the Maximalization of the witness sets in Independent Set readings
... The present paper suggests instead that such an oddity stems from Pragmatics. No English speaker would ever utter those sentences in those contexts, as they would not be informative enough, and so they would violate a ...
10
A Study on the Inj Equitable Graph of a Graph
... The Inj-equitable dominating sets on graphs which introduced in [7] motivated us to define two new graphs: the IE-graph of a graph and the IE-graph. In this section, we define the Inj-equitable graph of a graph ...
10
On a conjecture of Street and Whitehead on locally maximal product free sets
... locally maximal if whenever T is product-free and S ⊆ T , then S = T ...locally maximal product-free set in G fills ...locally maximal product-free sets of sizes 3 and 4 in dihedral groups, ...
14
From matchings to independent sets
... We have seen already a graph transformation helpful for the maximum independent set problem, namely, the vertex splitting in Section 3.2. Now, let us look at this transformation in the reverse order, in which case ...
21