Results 11 to 20 of about 8,249,666 (288)
Domination in m− polar soft fuzzy graphs
Ratio Mathematica, 2023 In this paper, we have introduced dominating set, minimal dominating set, independent dominating set, maximal independent dominating set in m − polar soft fuzzy graphs.
S Ramkumar, R Sridevi
doaj +1 more source
Theoretical Computer Science, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Halldórsson, Magnús M. +3 more
openaire +1 more source
Eternal Independent Sets in Graphs
Theory and Applications of Graphs, 2016 The use of mobile guards to protect a graph has received much attention in the literature of late in the form of eternal dominating sets, eternal vertex covers and other models of graph protection.
Yair Caro, William Klostermeyer
doaj +1 more source
Independent Set Reconfiguration in Cographs [PDF]
, 2014 We study the following independent set reconfiguration problem, called TAR-Reachability: given two independent sets $I$ and $J$ of a graph $G$, both of size at least $k$, is it possible to transform $I$ into $J$ by adding and removing vertices one-by-one,
AE Mouawad +21 more
core +2 more sources
Combinatorics, Probability and Computing, 2012 The study of extremal problems related to independent sets in hypergraphs is a problem that has generated much interest. There are a variety of types of independent sets in hypergraphs depending on the number of vertices from an independent set allowed in an edge.
Cutler, Jonathan, Radcliffe, A. J.
openaire +3 more sources
Counting Independent Sets in Hypergraphs [PDF]
Combinatorics, Probability and Computing, 2014 Let G be a triangle-free graph with n vertices and average degree t. We show that G contains at least ${\exp\biggl({1-n^{-1/12})\frac{1}{2}\frac{n}{t}\ln t} \biggl(\frac{1}{2}\ln t-1\biggr)\biggr)}$ independent sets. This improves a recent result of the first and third authors [8]. In particular, it implies that as n → ∞, every triangle-free graph on n
Cooper, J., Dutta, K., Mubayi, D.
openaire +4 more sources
Edge Metric Dimension and Edge Basis of One-Heptagonal Carbon Nanocone Networks
IEEE Access, 2022 A molecular (chemical) graph is a simple connected graph, where the vertices represent the compound’s atoms and the edges represent bonds between the atoms, and the degree (valence) of every vertex (atom) is not more than four.
Karnika Sharma +2 more
doaj +1 more source
Critical sets, crowns and local maximum independent sets [PDF]
Journal of Global Optimization, 2021 19 pages, 11 ...
Vadim E. Levit, Eugen Mandrescu
openaire +3 more sources
On the Independence Number of Cayley Digraphs of Clifford Semigroups
Mathematics, 2023 Let S be a Clifford semigroup and A a subset of S. We write Cay(S,A) for the Cayley digraph of a Clifford semigroup S relative to A. The (weak, path, weak path) independence number of a graph is the maximum cardinality of an (weakly, path, weakly path ...
Krittawit Limkul, Sayan Panma
doaj +1 more source
Ultrafilters and Independent Sets [PDF]
Transactions of the American Mathematical Society, 1972 Independent families of sets and of functions are used to prove some theorems about ultrafilters. All of our results are well known to be provable from some form of the generalized continuum hypothesis, but had remained open without such an assumption.
openaire +1 more source