18,731 research outputs found
Partitioning the vertex set of to make an efficient open domination graph
A graph is an efficient open domination graph if there exists a subset of
vertices whose open neighborhoods partition its vertex set. We characterize
those graphs for which the Cartesian product is an efficient
open domination graph when is a complete graph of order at least 3 or a
complete bipartite graph. The characterization is based on the existence of a
certain type of weak partition of . For the class of trees when is
complete of order at least 3, the characterization is constructive. In
addition, a special type of efficient open domination graph is characterized
among Cartesian products when is a 5-cycle or a 4-cycle.Comment: 16 pages, 2 figure
Some Results on [1, k]-sets of Lexicographic Products of Graphs
A subset in a graph is called a -set, if
for every vertex , . The
-domination number of , denoted by is the size
of the smallest -sets of . A set is called a total
-set, if for every vertex , .
If a graph has at least one total -set then the cardinality of the
smallest such set is denoted by . We consider -sets that are also independent. Note that not every graph has an
independent -set. For graphs having an independent -set, we
define -independence numbers which is denoted by .
In this paper, we investigate the existence of -sets in lexicographic
products . Furthermore, we completely characterize graphs which their
lexicographic product has at least one total -set. Also, we determine
, and . Finally, we show that finding smallest total -set is
-complete
Broadcast Domination of Triangular Matchstick Graphs and the Triangular Lattice
Blessing, Insko, Johnson and Mauretour gave a generalization of the
domination number of a graph called the broadcast domination
number which depends on the positive integer parameters and . In this
setting, a vertex is a broadcast vertex of transmission strength
if it transmits a signal of strength to every vertex ,
where denotes the distance between vertices and and . Given a set of broadcast vertices , the reception at vertex
is the sum of the transmissions from the broadcast vertices in . The set
is called a broadcast dominating set if every vertex has a reception strength and for a finite graph the
cardinality of a smallest broadcast dominating set is called the
broadcast domination number of . In this paper, we consider the infinite
triangular grid graph and define efficient broadcast dominating sets as
those broadcasts that minimize signal waste. Our main result constructs
efficient broadcasts on the infinite triangular lattice for all . Using these broadcasts, we then provide upper bounds for the
broadcast domination numbers for triangular matchstick graphs when
.Comment: 18 pages, 19 figures, 1 tabl
Domination Polynomials of Graph Products
The domination polynomials of binary graph operations, aside from union, join
and corona, have not been widely studied. We compute and prove recurrence
formulae and properties of the domination polynomials of families of graphs
obtained by various products, ranging from explicit formulae and recurrences
for specific families to more general results. As an application, we show the
domination polynomial is computationally hard to evaluate.Comment: 17 page
Roman domination in Cartesian product graphs and strong product graphs
A set of vertices of a graph is a dominating set for if every
vertex outside of is adjacent to at least one vertex belonging to . The
minimum cardinality of a dominating set for is called the domination number
of . A map is a Roman dominating function on
a graph if for every vertex with , there exists a vertex ,
adjacent to , such that . The weight of a Roman dominating
function is given by . The minimum weight of a Roman
dominating function on is called the Roman domination number of . In
this article we study the Roman domination number of Cartesian product graphs
and strong product graphs. More precisely, we study the relationships between
the Roman domination number of product graphs and the (Roman) domination number
of the factors
Cops and Robber Game with a Fast Robber on Expander Graphs and Random Graphs
We consider a variant of the Cops and Robber game, in which the robber has
unbounded speed, i.e. can take any path from her vertex in her turn, but she is
not allowed to pass through a vertex occupied by a cop. Let c_{infty}(G) denote
the number of cops needed to capture the robber in a graph G in this variant.
We characterize graphs G with c_{infty}(G)=1, and give an O(|V(G)|^2) algorithm
for their detection. We prove a lower bound for c_{infty} of expander graphs,
and use it to prove three things. The first is that if np > 4.2 log n then the
random graph G = G(n,p) asymptotically almost surely has e1/p < c_{infty}(G) <
e2 log (np)/p, for suitable constants e1 and e2. The second is that a
fixed-degree random regular graph G with n vertices asymptotically almost
surely has c_{infty}(G) = Theta(n). The third is that if G is a Cartesian
product of m paths, then n / 4km^2 < c_{infty}(G) < n / k, where n=|V(G)| and k
is the number of vertices of the longest path.Comment: 22 page
Domination Cover Number of Graphs
A set for the graph is called a dominating set if
any vertex has at least one neighbor in . Fomin et
al.[9] gave an algorithm for enumerating all minimal dominating sets with
vertices in time. It is known that the number of minimal
dominating sets for interval graphs and trees on vertices is at most
. In this paper, we introduce the domination cover
number as a new criterion for evaluating the dominating sets in graphs. The
domination cover number of a dominating set , denoted by ,
is the summation of the degrees of the vertices in . Maximizing or
minimizing this parameter among all minimal dominating sets have interesting
applications in many real-world problems, such as the art gallery problem.
Moreover, we investigate this concept for different graph classes and propose
some algorithms for finding the domination cover number in trees, block graphs
A general lower bound for the domination number of cylindrical graphs
In this paper we present a lower bound for the domination number of the
Cartesian product of a path and a cycle, that is tight if the length of the
cycle is a multiple of five. This bound improves the natural lower bound
obtained by using the domination number of the Cartesian product of two paths,
that is the best one known so far.Comment: 12 pages, 3 figure
Quasi-efficient domination in grids
Domination of grids has been proved to be a demanding task and with the
addition of independence it becomes more challenging. It is known that no grid
with has an efficient dominating set, also called perfect code,
that is, an independent vertex set such that each vertex not in it has exactly
one neighbor in that set. So it is interesting to study the existence of
independent dominating sets for grids that allow at most two neighbors, such
sets are called independent -sets. In this paper we prove that every
grid has an independent -set, and we develop a dynamic programming
algorithm using min-plus algebra that computes , the
minimum cardinality of an independent -set for the grid graph
. We calculate for using this algorithm, meanwhile the parameter for grids with is obtained through a quasi-regular pattern that, in addition,
provides an independent -set of minimum size.Comment: 17 pages, 16 figure
Algorithmic problems in right-angled Artin groups: complexity and applications
In this paper we consider several classical and novel algorithmic problems
for right-angled Artin groups, some of which are closely related to graph
theoretic problems, and study their computational complexity. We study these
problems with a view towards applications to cryptography.Comment: 16 page
- …