Bhatt, Tushar; Zalavadiya, Jayesh; Teraiya, Om(Journal of Emerging Technologies and Innovative Research (JETIR), 2018-12)
Domination theory is a part of Graph theory is used for finding communities in networks, device
for modeling, description of real world network systems such are : Transport, Water, Electricity, Internet
and many more. ...
Bhatt, Tushar; Bhimani, G.(Malaya Journal of Matematik, 2021)
According to the research paper on Perfect Dominating Sets by Marilynn Livingston and Quentin F. Stout[1]they
have been constructed the PDSs in families of graphs arising from the interconnected networks of parallel
computers ...
Bhatt, Tushar; Bhimani, G.(Kala : The Journal of Indian Art History Congress, 2021)
An Ad-hoc network is one that is spontaneously formed when device connect and communicate with each
other. It is mostly wireless local area network (WLANs). The devices communicate with each other directly
instead of ...
Bhatt, Tushar; Bhimani, G.(Journal of Science, KCG-portal of Journals, 2020-05)
In this paper we can try to find a relationship between two different disciplines as theory
of domination and operation research. In that concern we can try to make, a domination model for
linear programming problem ...
Bhatt, Tushar; Bhimani, G.(International Journal of Research in Humanities & Soc. Sciences, 2020-04)
In this paper we can try to find a relationship between two different disciplines as theory of domination
and operation research. In that concern we can try to make, a domination model for linear
programming problem ...
Bhatt, Tushar; Bhimani, G.(Journal of Emerging Technologies and Innovative Research (JETIR), 2019-06)
In this paper we are trying to find that the domination
number of any graph is obtain by using familiar method as
vertex domination techniques and edge domination techniques
but from the both who one is faster than ...
Vaidya, S.; Vyas, N.(AMO - Advanced Modeling and Optimization, 2014)
For the graph G = (V (G), E(G)), a function f : V (G) →
{0, 1} is called a product cordial labeling of G if the induced edge labeling
function defined by the product of end vertex labels be such that the edges
with label ...
Vaidya, S.; Vyas, N.(Malaya Journal of Matematic (MJM) - An International Journal of mathematical science with computer applications, 2014)
The product cordial labeling is a variant of cordial labeling. Here we investigate product cordial labeling for alternate triangular snake and alternate quadrilateral snake graphs
Vaidya, S.; vyas, N.(International Journal of Graph Theory(IJOGT), 2013-12)
A function f: V(G) →{2,4, …, 2|E(G)|} is called an even mean labeling of graph G if it is injective and when
each edge e=uv is labeled with average sum of f(u) and f(v) then the resulting edge labels are distinct. Here ...
Vaidya, S.; Vyas, N.(Annals of Pure and Applied Mathematics, 2013)
An edge labeling of a graph is a bijection from E(G) to the set {1,2,… , |E(G)|}.
If for any two distinct vertices u and v, the sum of labels on the edges incident to u is
different from the sum of labels on the edges ...
Vaid, S.; Vyas, N.(International Journal of Mathematics and Scientific Computing, 2012)
A binary vertex labeling f : E(G) → {0, 1} with
induced labeling f
∗
: V (G) → {0, 1} defined by f
∗ P
(v) =
{f(uv) | uv ∈ E(G)}(mod 2) is called E-cordial labeling of
a graph G if the number of vertices labeled 0 ...
Vaidya, S.; Vyas, N.(International Journal of Advanced Computer and Mathematical Sciences, 2012)
Let G=(V(G),E(G)) be a graph and f E G : ( ) {0,1} → be a binary edge labeling. Define *
f V G : ( ) {0,1} → by
*
( )
( ) ( )( 2)
uv E G
f v f uv mod
∈
= ∑ . The function f is called E-cordial labeling of G if | ...
Vaidya, S.; Vyas, N.(Annals of Pure and Applied Mathematics, 2012)
A graph with q edges is called antimagic if its edges can be labeled with
1, 2,…,q such that the sums of the labels of the edges incident to each vertex are
distinct. Here we prove that the graphs obtained by switching ...
Let G be a bipartite graph with a partite sets V1
and V2
and G′ be the copy of G with corresponding
partite sets V1
′ and V2
′ . The mirror graph M(G) of G is obtained from G and G′ by joining each vertex
of V1
...
Vaidya, S.; Vyas, N.(Studies in Mathematical Sciences, CSCanada, 2011-11)
We investigate E-cordial labeling for some cartesian product of graphs. We prove that the graphs Kn × P2
and Pn × P2 are E-cordial for n even while Wn × P2 and K1,n × P2 are E-cordial for n odd.
Vaidya, S.; Vyas, N.(Journal of Mathematics Research, 2011-08)
For the graph G1 and G2 the tensor product is denoted by G1(Tp)G2 which is the graph with vertex set V(G1(Tp)G2) =
V(G1) × V(G2) and edge set E(G1(Tp)G2) = {(u1, v1), (u2, v2)/u1u2 E(G1) and v1v2 E(G2)}. The graph Pm(Tp)Pn ...
Vaidya, S.K.; Ajani, P.D.(Journal of Scientific Research, 2021)
For a graph G=(V, E), a set S⊆ V (S⊆ E) is a restrained dominating (restrained edge dominating) set if every vertex (edge) not in S is adjacent (incident) to a vertex (edge) in S and to a vertex (edge) in V-S (ES). The ...
Vaidya, S.K.; Ajani, P.D.(Malaya Journal of Matematik, 2020)
A dominating set S ⊆ V is said to be a restrained dominating set of graph G if every vertex not in S is adjacent
to a vertex in S and also to a vertex in V − S. A set S ⊆ V is called an equitable dominating set if for ...
Vaidya, S.K.; Ajani, P.D.(Malaya Journal of Matematik, 2020)
For a graph G = (V,E), a subset D of E is restrained edge dominating set of G if every edge not in D is adjacent
to an edge in D as well as an edge in E −D. The restrained edge domination number of G, denoted by γre(G)
is ...