Results 1 to 10 of about 2,603,204 (120)

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, Joseph Varghese Kureethara   +1 more
doaj   +1 more source

Improved (In-)Approximability Bounds for d-Scattered Set

Journal of Graph Algorithms and Applications, 2023
In the $d$-${\rm S{\small CATTERED}\;S{\small ET}}$ problem we are asked to select at least $k$ vertices of a given graph, so that the distance between any pair is at least $d$.
Ioannis Katsikarelis, Michael Lampis, Vangelis Paschos   +2 more
doaj   +1 more source

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, Saeed Kosari, Seyed Mahmoud Sheikholeslami, M. Chellali, Mahla Kheibari   +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, Vahan V. Mkrtchyan, Vahe L. Musoyan, Hovhannes Sargsyan   +3 more
doaj   +1 more source

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

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

Coloring and Guarding Arrangements [PDF]

Discrete Mathematics & Theoretical Computer Science, 2013
Combinatorics
Prosenjit Bose, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Matias Korman, Stefan Langerman, Perouz Taslakian   +6 more
doaj   +1 more source

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

Algorithmic Aspects of Some Variants of Domination in Graphs

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2020
A set S ⊆ V is a dominating set in G if for every u ∈ V \ S, there exists v ∈ S such that (u, v) ∈ E, i.e., N[S] = V . A dominating set S is an isolate dominating set (IDS) if the induced subgraph G[S] has at least one isolated vertex.
Kumar J. Pavan, Reddy P.Venkata Subba
doaj   +1 more source