6,756 research outputs found
Minus total domination in graphs
summary:A three-valued function defined on the vertices of a graph is a minus total dominating function (MTDF) if the sum of its function values over any open neighborhood is at least one. That is, for every , , where consists of every vertex adjacent to . The weight of an MTDF is , over all vertices . The minus total domination number of a graph , denoted , equals the minimum weight of an MTDF of . In this paper, we discuss some properties of minus total domination on a graph and obtain a few lower bounds for
Remarks on minus (signed) total domination in graphs
Author name used in this publication: T.C.E. ChengAuthor name also used in this publication: E.F. Shan2007-2008 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe
A note on domination and minus domination numbers in cubic graphs
Author name used in this publication: C. T. Ng2005-2006 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe
The domination game played on unions of graphs
Abstract In a graph G, a vertex is said to dominate itself and its neighbors. The Domination game is a two player game played on a finite graph. Players alternate turns in choosing a vertex that dominates at least one new vertex. The game ends when no move is possible, that is when the set of chosen vertices forms a dominating set of the graph. One player (Dominator) aims to minimize the size of this set while the other (Staller) tries to maximize it. The game domination number, denoted by γg, is the number of moves when both players play optimally and Dominator starts. The Staller-start game domination number γ g is defined similarly when Staller starts. It is known that the difference between these two values is at most one We first describe a family of graphs that we call no-minus graphs, for which no player gets advantage in passing a move. While it is known that forests are no-minus, we prove that tri-split graphs and dually chordal graphs also are no-minus. Then, we show that the domination game parameters of the union of two no-minus graphs can take only two values according to the domination game parameters of the initial graphs. In comparison, we also show that in the general case, up to four values may be possible
Stochastic domination: the contact process, Ising models and FKG measures
We prove for the contact process on , and many other graphs, that the
upper invariant measure dominates a homogeneous product measure with large
density if the infection rate is sufficiently large. As a
consequence, this measure percolates if the corresponding product measure
percolates. We raise the question of whether domination holds in the symmetric
case for all infinite graphs of bounded degree. We study some asymmetric
examples which we feel shed some light on this question. We next obtain
necessary and sufficient conditions for domination of a product measure for
``downward'' FKG measures. As a consequence of this general result, we show
that the plus and minus states for the Ising model on dominate the same
set of product measures. We show that this latter fact fails completely on the
homogenous 3-ary tree. We also provide a different distinction between
and the homogenous 3-ary tree concerning stochastic domination and Ising
models; while it is known that the plus states for different temperatures on
are never stochastically ordered, on the homogenous 3-ary tree, almost
the complete opposite is the case. Next, we show that on , the set of
product measures which the plus state for the Ising model dominates is strictly
increasing in the temperature. Finally, we obtain a necessary and sufficient
condition for a finite number of variables, which are both FKG and
exchangeable, to dominate a given product measure.Comment: 27 page
Some remarks on domination in cubic graphs
We study three recently introduced numerical invariants of graphs, namely, the signed domination number γs, the minus domination number γ- and the majority domination number γmaj. An upper bound for γs and lower bounds for γ- and γmaj are found, in terms of the order of the graph
Further results on packing related parameters in graphs
Given a graph G = (V, E), a set B subset of 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 rho(G) of G is the maximum cardinality of a packing in G. Similarly, open packing sets and open packing number are defined for a graph G by using open neighborhoods instead of closed ones. We give several results concerning the (open) packing number of graphs in this paper. For instance, several bounds on these packing parameters along with some Nordhaus-Gaddum inequalities are given. We characterize all graphs with equal packing and independence numbers and give the characterization of all graphs for which the packing number is equal to the independence number minus one. In addition, due to the close connection between the open packing and total domination numbers, we prove a new upper bound on the total domination number gamma(t)(T) for a tree T of order n >= 2 improving the upper bound gamma(t)(T) <= (n + s)/2 given by Chellali and Haynes in 2004, in which s is the number of support vertices of T
- …