Results 41 to 50 of about 7,400,368 (352)
Mathematics, 2021 Many problems of practical interest can be modeled and solved by using fuzzy graph (FG) algorithms. In general, fuzzy graph theory has a wide range of application in various fields. Since indeterminate information is an essential real-life problem and is
Yongsheng Rao +4 more
doaj +1 more source
Minimum Neighborhood Domination of Split Graph of Graphs
مجلة بغداد للعلوم, 2023 Let be a non-trivial simple graph. A dominating set in a graph is a set of vertices such that every vertex not in the set is adjacent to at least one vertex in the set.
ANJALINE. W, A.STANIS ARUL MARY
doaj +1 more source
Future Internet, 2019 A mobile ad-hoc network (MANET) is a temporary network of wireless mobile nodes. In a MANET, it is assumed that all of the nodes cooperate with each other to transfer data packets in a multi-hop fashion. However, some malicious nodes don’t cooperate with
Z. Zardari +6 more
semanticscholar +1 more source
A Note on the Locating-Total Domination in Graphs
Discussiones Mathematicae Graph Theory, 2017 In this paper we obtain a sharp (improved) lower bound on the locating-total domination number of a graph, and show that the decision problem for the locating-total domination is NP-complete.
Miller Mirka +4 more
doaj +1 more source
Kernelization and Sparseness: the case of Dominating Set [PDF]
, 2015 We prove that for every positive integer $r$ and for every graph class $\mathcal G$ of bounded expansion, the $r$-Dominating Set problem admits a linear kernel on graphs from $\mathcal G$.
Drange, Pål Grønås +11 more
core +2 more sources
Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function (Extended Abstract) [PDF]
International Joint Conference on Artificial Intelligence, 2017 The Minimum Weight Dominating Set (MWDS) problem is an important generalization of the Minimum Dominating Set (MDS) problem with extensive applications.
Yiyuan Wang, Shaowei Cai, Minghao Yin
semanticscholar +1 more source
, 2022 We consider a minimizing variant of the well-known \emph{No-Three-In-Line Problem}, the \emph{Geometric Dominating Set Problem}: What is the smallest number of points in an $n\times n$~grid such that every grid point lies on a common line with two of the points in the set?
Aichholzer, Oswin +2 more
openaire +2 more sources
On redundant locating-dominating sets
Discrete Applied Mathematics, 2023 A locating-dominating set in a graph G is a subset of vertices representing "detectors" which can locate an "intruder" given that each detector covers its closed neighborhood and can distinguish its own location from its neighbors. We explore a fault-tolerant variant of locating-dominating sets called redundant locating-dominating sets, which can ...
Devin C. Jean, Suk J. Seo
openaire +3 more sources
Making a Dominating Set of a Graph Connected
Discussiones Mathematicae Graph Theory, 2018 Let G = (V,E) be a graph and S ⊆ V. We say that S is a dominating set of G, if each vertex in V \ S has a neighbor in S. Moreover, we say that S is a connected (respectively, 2-edge connected or 2-connected) dominating set of G if G[S] is connected ...
Li Hengzhe, Wu Baoyindureng, Yang Weihua
doaj +1 more source
Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set [PDF]
Opuscula MathematicaA graph \(G\) whose vertex set can be partitioned into a total dominating set and an independent dominating set is called a TI-graph. We give constructions that yield infinite families of graphs that are TI-graphs, as well as constructions that yield ...
Teresa W. Haynes, Michael A. Henning
doaj +1 more source