Results 1 to 10 of about 1,516 (111)
Reinforcement Number of a Graph with respect to Half-Domination
Journal of Mathematics, 2021 In this paper, we introduce the concept of reinforcement number with respect to half-domination and initiate a study on this parameter. Furthermore, we obtain various upper bounds for this parameter. AMS subject classification: 05C38, 05C40, 05C69.
G. Muhiuddin +4 more
doaj +3 more sources
Some properties of the closed global shadow graphs and their zero forcing number
Acta Universitatis Sapientiae: Informatica, 2022 Zero forcing is one of the dynamic vertex coloring problem. Zero forcing number is the minimum cardinality of the zero forcing sets. This parameter is the upper bound for the maximum nullity. A new class of graph where the maximum nullity is equal to the
Raksha M. R., Dominic Charles
doaj +1 more source
A New Upper Bound for the Perfect Italian Domination Number of a Tree
Discussiones Mathematicae Graph Theory, 2022 A perfect Italian dominating function (PIDF) on a graph G is a function f : V (G) → {0, 1, 2} satisfying the condition that for every vertex u with f(u) = 0, the total weight of f assigned to the neighbors of u is exactly two. The weight of a PIDF is the
Nazari-Moghaddam Sakineh +1 more
doaj +1 more source
Bounds on Domination Parameters in Graphs: A Brief Survey
Discussiones Mathematicae Graph Theory, 2022 In this paper we present a brief survey of bounds on selected domination parameters. We focus primarily on bounds on domination parameters in terms of the order and minimum degree of the graph. We present a list of open problems and conjectures that have
Henning Michael A.
doaj +1 more source
Further Results on Packing Related Parameters in Graphs
Discussiones Mathematicae Graph Theory, 2022 Given a graph G = (V, E), a set B ⊆ V (G) is a packing in G if the closed neighborhoods of every pair of distinct vertices in B are pairwise disjoint. The packing number ρ(G) of G is the maximum cardinality of a packing in G. Similarly, open packing sets
Mojdeh Doost Ali +2 more
doaj +1 more source
A Classification of Cactus Graphs According to their Domination Number
Discussiones Mathematicae Graph Theory, 2022 A set S of vertices in a graph G is a dominating set of G if every vertex not in S is adjacent to some vertex in S. The domination number, γ(G), of G is the minimum cardinality of a dominating set of G.
Hajian Majid +2 more
doaj +1 more source
Roman {2}-Domination Problem in Graphs
Discussiones Mathematicae Graph Theory, 2022 For a graph G = (V, E), a Roman {2}-dominating function (R2DF) f : V → {0, 1, 2} has the property that for every vertex v ∈ V with f(v) = 0, either there exists a neighbor u ∈ N(v), with f(u) = 2, or at least two neighbors x, y ∈ N(v) having f(x) = f(y) =
Chen Hangdi, Lu Changhong
doaj +1 more source
Bipartite graphs with close domination and k-domination numbers
Open Mathematics, 2020 Let kk be a positive integer and let GG be a graph with vertex set V(G)V(G). A subset D⊆V(G)D\subseteq V(G) is a kk-dominating set if every vertex outside DD is adjacent to at least kk vertices in DD. The kk-domination number γk(G){\gamma }_{k}(G) is the
Ekinci Gülnaz Boruzanlı +1 more
doaj +1 more source
Domination Number, Independent Domination Number and 2-Independence Number in Trees
Discussiones Mathematicae Graph Theory, 2021 For a graph G, let γ(G) be the domination number, i(G) be the independent domination number and β2(G) be the 2-independence number. In this paper, we prove that for any tree T of order n ≥ 2, 4β2(T) − 3γ(T) ≥ 3i(T), and we characterize all trees ...
Dehgardi Nasrin +4 more
doaj +1 more source
Restrained Domination in Self-Complementary Graphs
Discussiones Mathematicae Graph Theory, 2021 A self-complementary graph is a graph isomorphic to its complement. A set S of vertices in a graph G is a restrained dominating set if every vertex in V(G) \ S is adjacent to a vertex in S and to a vertex in V(G) \ S.
Desormeaux Wyatt J. +2 more
doaj +1 more source