Results 1 to 10 of about 783,181 (348)
Domatically perfect graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 A graph of order is domatically perfect if , where and denote the domination number and the domatic number, respectively. In this paper, we give basic results for domatically perfect graphs, and study a main problem; for a given graph , to find a ...
Naoki Matsumoto
doaj +2 more sources
Strong Perfect Cobondage Number of Standard Graphs
Ratio Mathematica, 2023 Let G be a simple graph. A subset S Í V(G) is called a strong (weak) perfect dominating set of G if |Ns(u) ∩ S| = 1(|Nw(u) ∩ S| = 1) for every u ∊V(G) - S where Ns(u) = {v ∊ V(G) / uv deg v ≥ deg u} (Nw(u) = {v ∊V(G) / uv deg v ≤ deg u}.
T. S Govindalakshmi, N Meena
doaj +1 more source
Perfect folding of graphs [PDF]
Delta Journal of Science, 2019 In this paper we introduced the definition of perfect foldingof graphs and we proved that cycle graphs of even number ofedges can be perfectly folded while that of odd number ofedges can be perfectly folded to C3 .
H. Ahmed, E. M. El-Kholy
doaj +1 more source
Perfect double Italian domination of a graph
AKCE International Journal of Graphs and Combinatorics, 2023 For a graph [Formula: see text] with [Formula: see text] and [Formula: see text], a perfect double Italian dominating function is a function [Formula: see text] having the property that [Formula: see text], for every vertex [Formula: see text] with ...
Guoliang Hao +2 more
doaj +1 more source
Perfect Fuzzy Soft Tripartite Graphs and Their Complements
Discrete Dynamics in Nature and Society, 2022 Fuzzy soft graphs are efficient numerical tools for simulating the uncertainty of the real world. A fuzzy soft graph is a perfect fusion of the fuzzy soft set and the graph model that is widely used in a variety of fields.
Kalaichelvan Kalaiarasi +4 more
doaj +1 more source
Total perfect codes in graphs realized by commutative rings [PDF]
Transactions on Combinatorics, 2022 Let $R$ be a commutative ring with unity not equal to zero and let $\Gamma(R)$ be a zero-divisor graph realized by $R$. For a simple, undirected, connected graph $G = (V, E)$, a {\it total perfect code} denoted by $C(G)$ in $G$ is a subset $C(G ...
Rameez Raja
doaj +1 more source
Exploration of CPCD number for power graph
مجلة بغداد للعلوم, 2023 Recently, complementary perfect corona domination in graphs was introduced. A dominating set S of a graph G is said to be a complementary perfect corona dominating set (CPCD – set) if each vertex in is either a pendent vertex or a support vertex and ...
S. Anuthiya, G. Mahadevan, C. Sivagnanam
doaj +1 more source
Weakly Perfect Graphs of Modules [PDF]
Control and Optimization in Applied Mathematics, 2019 In this study, $R$ and $M$ are assumed to be a commutative ring with non-zero identity $M$ and an $R$-module, respectively. Scalar Product Graph of $M$, denoted by $G_R(M)$, is a graph with the vertex-set $M$ and two different vertices $a$ and $b$ in $M$
Mostafa Nouri Jouybari +2 more
doaj +1 more source
Planar cycle-extendable graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceFor most problems pertaining to perfect matchings, one may restrict attention to matching covered graphs - that is, connected nontrivial graphs with the property that each edge belongs to some perfect matching.
Aditya Y Dalwadi +3 more
doaj +1 more source
All Pairs of Pentagons in Leapfrog Fullerenes Are Nice
Mathematics, 2020 A subgraph H of a graph G with perfect matching is nice if G−V(H) has perfect matching. It is well-known that all fullerene graphs have perfect matchings and that all fullerene graphs contain some small connected graphs as nice subgraphs.
Tomislav Došlić
doaj +1 more source