Results 1 to 10 of about 149,462 (159)
Split Domination in Neutrosophic Graphs [PDF]
Neutrosophic Sets and Systems, 2021 This paper demonstrates a concept of split domination in neutrosophic graphs.Minimal split domination, lower and upper split dominations in neutrosophic graphs are discussed.
M. Mullai +3 more
doaj +2 more sources
Split Domination Decomposition of Path Graphs
Ratio Mathematica, 2022 A decomposition (G1, G2, G3, …, Gn) of G is said to be a split domination decomposition (SDD), if the following conditions are satisfied:(i) each Gi is connected(ii), 1.
E Ebin RajaMerly, B Praisy
doaj +2 more sources
Semi-strong split domination in graphs [PDF]
Transactions on Combinatorics, 2014 Given a graph $G = (V,E)$, a dominating set $D subseteq V$ is called a semi-strong split dominating set of $G$ if $|V setminus D| geq 1$ and the maximum degree of the subgraph induced by $V setminus D$ is 1.
Anwar Alwardi +3 more
doaj +2 more sources
Computing the split domination number of grid graphs
Indonesian Journal of Combinatorics, 2021 A set D - V is a dominating set of G if every vertex in V - D is adjacent to some vertex in D. The dominating number γ(G) of G is the minimum cardinality of a dominating set D.
V. R. Girish, P. Usha
doaj +3 more sources
Split Legendary Domination in graphs
Ratio MathematicaHarary and Norman introduced the line graph L(G) . We introduced the legendary domination number by combining the domination concept both in graph and its line graph.
P. Kavitha
doaj +2 more sources
Semipaired Domination in Some Subclasses of Chordal Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 A dominating set $D$ of a graph $G$ without isolated vertices is called semipaired dominating set if $D$ can be partitioned into $2$-element subsets such that the vertices in each set are at distance at most $2$. The semipaired domination number, denoted
Michael A. Henning +2 more
doaj +1 more source
Split Domination Number in Edge Semi-Middle Graph
Pan-American Journal of Mathematics, 2022 Let G = (p, q) be a connected graph and Me(G) be its corresponding edge semi-middle graph. A dominating set D ⊆ V [Me(G)] is split dominating set V [Me(G)] – D is disconnected.
Venkanagouda M. Goudar +2 more
doaj +1 more source
On Power Graph of Some Finite Rings [PDF]
Mathematics Interdisciplinary Research, 2023 Consider a ring $R$ with order $p$ or $p^2$, and let $\mathcal{P}(R)$ represent its multiplicative power graph. For two distinct rings $R_1$ and $R_2$ that possess identity element 1, we define a new structure called the unit semi-cartesian ...
Masoumeh Soleimani, Mohamad Hasan Naderi
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
Getting new algorithmic results by extending distance-hereditary graphs via split composition [PDF]
PeerJ Computer Science, 2021 In this paper, we consider the graph class denoted as Gen(∗;P3,C3,C5). It contains all graphs that can be generated by the split composition operation using path P3, cycle C3, and any cycle C5 as components.
Serafino Cicerone, Gabriele Di Stefano
doaj +2 more sources