Study on a Strong and Weak n-Connected Total Perfect k-Dominating set in Fuzzy Graphs
نویسندگان
چکیده
In this paper, the concept of a strong n-Connected Total Perfect k-connected total perfect k-dominating set and weak n-connected in fuzzy graphs is introduced. current work, triple-connected dominating modified to an nctpkD(G) number γnctpD(G). New definitions are compared with old ones. Strong obtained. The results those sets discussed spanning graphs, arcs, sets, generalization complete, connected, bipartite, cut node, tree, bridge some other new notions which analyzed graphs. order size studied. Additionally, few related theorems statements analyzed.
منابع مشابه
On minimum connected dominating set problem in unit-ball graphs
Given a graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D such that its induced subgraph is connected and each vertex outside D has at least one neighbor in D. Approximations of minimum connected dominating sets are often used to represent a virtual routing backbone in wireless networks. This paper proposes a constant-ratio approximation a...
متن کاملTotal perfect codes, OO-irredundant and total subdivision in graphs
Let $G=(V(G),E(G))$ be a graph, $gamma_t(G)$. Let $ooir(G)$ be the total domination and OO-irredundance number of $G$, respectively. A total dominating set $S$ of $G$ is called a $textit{total perfect code}$ if every vertex in $V(G)$ is adjacent to exactly one vertex of $S$. In this paper, we show that if $G$ has a total perfect code, then $gamma_t(G)=ooir(G)$. As a consequence, ...
متن کاملOn Graphs with No Proper Perfect Dominating Set
A set of vertices in a graph is perfect dominating if every vertex outside the set is adjacent to exactly one vertex in the set, and is neighborhood connected if the subgraph induced by its open neighborhood is connected. In any graph the full set of vertices is perfect dominating, and in every connected graph the full set of vertices is neighborhood connected. It is shown that (i) in a connect...
متن کاملOn minimum m -connected k -dominating set problem in unit disc graphs
Minimum m-connected k-dominating set problem is as follows: Given a graph G= (V ,E) and two natural numbers m and k, find a subset S ⊆ V of minimal size such that every vertex in V \ S is adjacent to at least k vertices in S and the induced graph of S is m-connected. In this paper we study this problem with unit disc graphs and small m, which is motivated by the design of fault-tolerant virtual...
متن کاملLossy Kernels for Connected Dominating Set on Sparse Graphs
In standard kernelization algorithms, the usual goal is to reduce, in polynomial time, an instance (I, k) of a parameterized problem to an equivalent instance (I ′, k′) of size bounded by a function in k. One of the central problems in this area, whose investigation has led to the development of many kernelization techniques, is the Dominating Set problem. Given a graph G and k ∈ N, Dominating ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2022
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math10173178