Results 1 to 10 of about 2,421,288 (269)
Independent partial domination
Cubo, 2021 For $p\in(0,1]$, a set $S\subseteq V$ is said to $p$-dominate or partially dominate a graph $G = (V, E)$ if $\frac{|N[S]|}{|V|}\geq p$. The minimum cardinality among all $p$-dominating sets is called the $p$-domination number and it is denoted by ...
L. Philo Nithya +1 more
doaj +1 more source
Extremal Independent Set Reconfiguration
The Electronic Journal of Combinatorics, 2023 The independent set reconfiguration problem asks whether one can transform one given independent set of a graph into another, by changing vertices one by one in such a way the intermediate sets remain independent. Extremal problems on independent sets are widely studied: for example, it is well known that an $n$-vertex graph has at most $3^{n/3 ...
Bousquet, Nicolas +3 more
openaire +2 more sources
1-Extendability of Independent Sets
Algorithmica, 2022 Abstract In the 70s, Berge introduced 1-extendable graphs (also called B-graphs), which are graphs where every vertex belongs to a maximum independent set. Motivated by an application in the design of wireless networks, we study the computational complexity of 1-extendability, the problem of deciding whether a graph is 1-extendable.
Pierre Bergé +3 more
openaire +4 more sources
On the Outer-Independent Double Roman Domination of Graphs
Frontiers in Applied Mathematics and Statistics, 2021 An outer-independent double Roman dominating function (OIDRDF) of a graph G is a function h:V(G)→{0,1,2,3} such that i) every vertex v with f(v)=0 is adjacent to at least one vertex with label 3 or to at least two vertices with label 2, ii) every vertex ...
Yongsheng Rao +4 more
doaj +1 more source
Minimization of Boolean functions in the class of orthogonal disjunctive normal forms
Informatika, 2021 The orthogonal disjunctive normal forms (DNFs) of Boolean functions have wide applications in the logical design of discrete devices. The problem of DNF orthogonalization is to get for a given function such a DNF that any two its terms would be ...
Yu. V. Pottosin
doaj +1 more source
The hardness of the independence and matching clutter of a graph [PDF]
Opuscula Mathematica, 2016 A clutter (or antichain or Sperner family) \(L\) is a pair \((V,E)\), where \(V\) is a finite set and \(E\) is a family of subsets of \(V\) none of which is a subset of another.
Sasun Hambardzumyan +3 more
doaj +1 more source
Stability for Maximal Independent Sets [PDF]
The Electronic Journal of Combinatorics, 2020 Answering questions of Y. Rabinovich, we prove "stability" versions of upper bounds on maximal independent set counts in graphs under various restrictions. Roughly these say that being close to the maximum implies existence of a large induced matching or triangle matching (depending on assumptions).
Kahn, Jeff, Park, Jinyoung
openaire +3 more sources
Independent Dominating Set on Chain of Fuzzy Graphs
Tikrit Journal of Pure Science, 2023 In this paper, we applied some properties on chain fuzzy graphs, which comprise vertex identification. These properties are independent sets and independent dominant sets.
Russel H. Majeed, Nabeel E. Arif
doaj +1 more source
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
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