Results 11 to 20 of about 51,346 (268)
Characterizing minimal point set dominating sets
AKCE International Journal of Graphs and Combinatorics, 2016 A set D of vertices in a graph G=(V,E) is said to be a point-set dominating set (or, in short, psd-set) of G if for every subset S of V−D there exists a vertex v∈D such that the subgraph 〈S∪{v}〉 is connected; the set of all psd-sets of G will be denoted Dps(G).
Purnima Gupta, Rajesh Singh, S. Arumugam
openaire +3 more sources
Efficient Domination In Fuzzy Graphs and Intuitionistic Fuzzy Graphs in Strong and weak forms [PDF]
E3S Web of Conferences, 2023 This work defines the concepts of strong efficient dominating set and intuitionistic fuzzy graph. We also introduce an intuitionistic fuzzy graph and a strong efficient dominating number of fuzzy graphs.
S Rajeev Gandhi +4 more
doaj +1 more source
On minimum intersections of certain secondary dominating sets in graphs [PDF]
Opuscula Mathematica, 2023 In this paper we consider secondary dominating sets, also named as \((1,k)\)-dominating sets, introduced by Hedetniemi et al. in 2008. In particular, we study intersections of the \((1,1)\)-dominating sets and proper \((1,2)\)-dominating sets.
Anna Kosiorowska +2 more
doaj +1 more source
New Algorithms for Mixed Dominating Set [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 A mixed dominating set is a collection of vertices and edges that dominates all vertices and edges of a graph. We study the complexity of exact and parameterized algorithms for \textsc{Mixed Dominating Set}, resolving some open questions.
Louis Dublois +2 more
doaj +1 more source
DOMINATION AND EDGE DOMINATION IN TREES
Ural Mathematical Journal, 2020 Let \(G=(V,E)\) be a simple graph. A set \(S\subseteq V\) is a dominating set if every vertex in \(V \setminus S\) is adjacent to a vertex in \(S\).
B. Senthilkumar +2 more
doaj +1 more source
On Hop Roman Domination in Trees [PDF]
Communications in Combinatorics and Optimization, 2019 Let $G=(V,E)$ be a graph. A subset $S\subset V$ is a hop dominating set if every vertex outside $S$ is at distance two from a vertex of $S$. A hop dominating set $S$ which induces a connected subgraph is called a connected hop dominating set of $G$.
N. Jafari Rad, A. Poureidi
doaj +1 more source
Connected End Anti-Fuzzy Equitable Dominating Set In Anti-Fuzzy Graphs
Ratio Mathematica, 2023 In this paper, the notion of connected end anti-fuzzy equitable dominating set of an anti-fuzzy graph is discussed. The connected end anti-fuzzy equitable domination number for some standard graphs are obtained.
Janofer K, S.Firthous Fatima
doaj +1 more source
Closed neutrosophic dominating set in neutrosophic graphs [PDF]
Neutrosophic Sets and Systems, 2023 The aim of this article is to concentrate on the notion of closed neutrosophic domination (CND) number 𝛾𝑐𝑙 (𝐺) of a neutrosophic graph (NG) with using effective edge, furthermore we gain a few outcomes on this notion, the relation between 𝛾𝑐𝑙 (𝐺) and ...
Amir Majeed Nabeel Arif
doaj +1 more source
New Results on Directed Edge Dominating Set [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 We study a family of generalizations of Edge Dominating Set on directed graphs called Directed $(p,q)$-Edge Dominating Set. In this problem an arc $(u,v)$ is said to dominate itself, as well as all arcs which are at distance at most $q$ from $v$, or at ...
Rémy Belmonte +4 more
doaj +1 more source
Neutrosophic special dominating set in neutrosophic graphs [PDF]
Neutrosophic Sets and Systems, 2021 The neutrosophic graph is a new version of graph theory that has recently been proposed as an extension of fuzzy graph and intuitionistic fuzzy graph that provides more precision compatibility and flexibility than a fuzzy graph and an intuitionistic ...
Sadegh Banitalebi, Rajab Ali Borzooei
doaj +1 more source