Results 11 to 20 of about 149,581 (278)
Power domination in splitting and degree splitting graph
Proyecciones (Antofagasta), 2021 A vertex set S is called a power dominating set of a graph G if every vertex within the system is monitored by the set S following a collection of rules for power grid monitoring. The power domination number of G is the order of a minimal power dominating set of G.
Anitha, J., Muthukumar, S.
openaire +3 more sources
Split domination of splitted graphs
, 2021 In this paper, we introduce and investigate some new splitted graphs called \(S(P_l); S(H_l); S(P^+_l ), S(P_loNK_1) .\) Also we discuss some splitted graphs and it's properties are obtained.
, A.Esakkimuthu, Nethaji, O.
openaire +1 more source
Dominated splittings for flows with singularities [PDF]
Nonlinearity, 2013 15 pages, 4 figures; streamlined presentation; statement and proof of main theorem corrected; included new application to obtain hyperbolicity for three-dimensional flows; some corrections suggested by the ...
Araujo, Vitor +2 more
openaire +2 more sources
Ideal based graph structures for commutative rings
Cubo, 2022 We introduce a graph structure $\gamrr$ for commutative rings with unity. We study some of the properties of the graph $\gamrr$. Also we study some parameters of $\gamrr$ and find rings for which $\gamrr$ is split.
M. I. Jinnah, Shine C. Mathew
doaj +1 more source
Mathematics, 2022 A domination coloring of a graph G is a proper vertex coloring of G, such that each vertex of G dominates at least one color class (possibly its own class), and each color class is dominated by at least one vertex.
Yangyang Zhou +3 more
doaj +1 more source
Domination parameters with number 2: Interrelations and algorithmic consequences [PDF]
, 2018 In this paper, we study the most basic domination invariants in graphs, in which number 2 is intrinsic part of their definitions. We classify them upon three criteria, two of which give the following previously studied invariants: the weak 2-domination ...
Bonomo, Flavia +4 more
core +2 more sources
Total Domishold Graphs: a Generalization of Threshold Graphs, with Connections to Threshold Hypergraphs [PDF]
, 2013 A total dominating set in a graph is a set of vertices such that every vertex of the graph has a neighbor in the set. We introduce and study graphs that admit non-negative real weights associated to their vertices such that a set of vertices is a total ...
Chiarelli, Nina, Milanic, Martin
core +1 more source
0-1 Integer Linear Programming with a Linear Number of Constraints [PDF]
, 2014 We give an exact algorithm for the 0-1 Integer Linear Programming problem with a linear number of constraints that improves over exhaustive search by an exponential factor.
Impagliazzo, Russell +3 more
core +1 more source
Total 2-Rainbow Domination in Graphs
Mathematics, 2022 A total k-rainbow dominating function on a graph G=(V,E) is a function f:V(G)→2{1,2,…,k} such that (i) ∪u∈N(v)f(u)={1,2,…,k} for every vertex v with f(v)=∅, (ii) ∪u∈N(v)f(u)≠∅ for f(v)≠∅.
Huiqin Jiang, Yongsheng Rao
doaj +1 more source
On complex Banach manifolds similar to Stein manifolds [PDF]
, 2010 We give an abstract definition, similar to the axioms of a Stein manifold, of a class of complex Banach manifolds in such a way that a manifold belongs to the class if and only if it is biholomorphic to a closed split complex Banach submanifold of a ...
Patyi, Imre
core +3 more sources