Results 11 to 20 of about 259 (109)
Clique number and Girth of the Rough Co-zero Divisor Graph
, 2021 This study aims to determine the Clique number, Girth and Maximal independence number of the Rough Co-zero divisor Graph corresponding to a Rough semiring (T, ∆, ∇). The methodology of these graph theoretical parameters are obtained using partition
et. al., Dr.B. Praba,
core +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
Minimal driver sets on path and cycle graphs with arbitrary non-zero weights [PDF]
, 2022 Let $G$ be a simple, undirected graph on the vertex set $V=\{1,2,\ldots ,n\}$ and let $A$ be the adjacency matrix of $G.$ A non-empty subset $ \{i_{1},i_{2},\ldots ,i_{k}\}$ of $V$ is called a driver set for $G$ if the system $\mathbf{\dot{x}}=A\mathbf{x}
Maks, Johannes G.
core +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
Bounds on the Double Italian Domination Number of a Graph
Discussiones Mathematicae Graph Theory, 2022 For a graph G, a Roman {3}-dominating function is a function f : V → {0, 1, 2, 3} having the property that for every vertex u ∈ V, if f(u) ∈ {0, 1}, then f(N[u]) ≥ 3.
Azvin Farzaneh, Rad Nader Jafari
doaj +1 more source
Hereditary Equality of Domination and Exponential Domination
Discussiones Mathematicae Graph Theory, 2018 We characterize a large subclass of the class of those graphs G for which the exponential domination number of H equals the domination number of H for every induced subgraph H of G.
Henning Michael A. +2 more
doaj +1 more source
(C3, C4, C5, C7)-Free Almost Well-Dominated Graphs
Discussiones Mathematicae Graph Theory, 2022 The domination gap of a graph G is defined as the di erence between the maximum and minimum cardinalities of a minimal dominating set in G. The term well-dominated graphs referring to the graphs with domination gap zero, was first introduced by Finbow et
Alizadeh Hadi +2 more
doaj +1 more source
On Generalized Sierpiński Graphs
Discussiones Mathematicae Graph Theory, 2017 In this paper we obtain closed formulae for several parameters of generalized Sierpiński graphs S(G, t) in terms of parameters of the base graph G. In particular, we focus on the chromatic, vertex cover, clique and domination numbers.
Rodríguez-Velázquez Juan Alberto +2 more
doaj +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
Power Domination in Knödel Graphs and Hanoi Graphs
Discussiones Mathematicae Graph Theory, 2018 In this paper, we study the power domination problem in Knödel graphs WΔ,2ν and Hanoi graphs Hpn$H_p^n $ . We determine the power domination number of W3,2ν and provide an upper bound for the power domination number of Wr+1,2r+1 for r ≥ 3.
Varghese Seethu +2 more
doaj +1 more source