Add to ORKGA dominating set D of a graph G = G(V, E) is called metro dominating set if for every pair of vertices u, v there exists a vertex w in D such that “d(u,w) ≠ d(v, w). The ”-metro domination number of Cartesian product of C3 x Cn (ꝩβk (C3 x Cn)), is the order of smallest -dominating set of C3 x Cn which resolves as a metric set. In this paper we determine -metro domination number of Cartesian product of C3 x Cn
A subset S of vertices in a graph G is called a geodetic set if every vertex not in S lies on a sho...
In this paper we consider the Cartesian product of an arbitrary graph and a complete graph of order ...
A dominating set D of a graph G which is also a resolving set of G is called a metro dominating set....
A “dominating set D of a graph G = G (V, E) is called Metro dominating set of G. If for every pair o...
A “dominating set D of a graph G = G(V, E) is called Metro dominating set of G. If for every pair of...
A “subset D of the vertex set V of the graph is said to be a dominating set if every vertex in...
AbstractLet γ(G) be the domination number of a graph G and let G □ H denote the Cartesian product of...
A dominating set D of a graph G(V,E) is called metro dominating set G if for every pair of vertices ...
A subset D of the vertex set V of the graph is said to be a dominating set if every vertex in ...
AbstractLet γ(G) denote the domination number of a graph G and let Cn□G denote the cartesian product...
The study of domination in Cartesian products has received its main motivation from attempts to sett...
Let be a simple graph on the vertex set . In a graph G, A set is a dominating set of G if every ...
Given a graph G, a dominating set D is a set of vertices such that any vertex in G has at least one ...
Let γₜ(G) and $γ_{pr}(G)$ denote the total domination and the paired domination numbers of graph G, ...
Denote by γ(G) the domination number of a digraph G and Cm□Cn the Cartesian product of Cm and Cn, th...
A subset S of vertices in a graph G is called a geodetic set if every vertex not in S lies on a sho...
In this paper we consider the Cartesian product of an arbitrary graph and a complete graph of order ...
A dominating set D of a graph G which is also a resolving set of G is called a metro dominating set....
A “dominating set D of a graph G = G (V, E) is called Metro dominating set of G. If for every pair o...
A “dominating set D of a graph G = G(V, E) is called Metro dominating set of G. If for every pair of...
A “subset D of the vertex set V of the graph is said to be a dominating set if every vertex in...
AbstractLet γ(G) be the domination number of a graph G and let G □ H denote the Cartesian product of...
A dominating set D of a graph G(V,E) is called metro dominating set G if for every pair of vertices ...
A subset D of the vertex set V of the graph is said to be a dominating set if every vertex in ...
AbstractLet γ(G) denote the domination number of a graph G and let Cn□G denote the cartesian product...
The study of domination in Cartesian products has received its main motivation from attempts to sett...
Let be a simple graph on the vertex set . In a graph G, A set is a dominating set of G if every ...
Given a graph G, a dominating set D is a set of vertices such that any vertex in G has at least one ...
Let γₜ(G) and $γ_{pr}(G)$ denote the total domination and the paired domination numbers of graph G, ...
Denote by γ(G) the domination number of a digraph G and Cm□Cn the Cartesian product of Cm and Cn, th...
A subset S of vertices in a graph G is called a geodetic set if every vertex not in S lies on a sho...
In this paper we consider the Cartesian product of an arbitrary graph and a complete graph of order ...
A dominating set D of a graph G which is also a resolving set of G is called a metro dominating set....