## Search

Now showing items 1-10 of 19

#### On the total H-irregularity strength of graphs: A new notion

(2018-02-28)

A total edge irregularity strength of G has been already widely studied in many
papers. The total -labeling is said to be a total edge irregular -labeling of the graph G if for
every two di erent edges e
1
and e
2
, ...

#### Bound of Distance Domination Number of Graph and Edge Comb Product Graph

(2017-09-11)

Let G =(V, E) be a simple, nontrivial, ﬁnite, connected and undirected graph. For
an integer 1 k diam(G), a distance k-dominating set of a connected graph G is a set S of
vertices of G such that every vertex of V ...

#### On Rainbow k-Connection Number of Special Graphs and It's Sharp Lower Bound

(2018-02-28)

Let G = (V; E) be a simple, nontrivial, nite, connected and undirected
graph. Let c be a coloring c : E(G) ! f1; 2; : : : ; sg; s 2 N. A path of edge colored
graph is said to be a rainbow path if no two edges on the ...

#### Implementation of Super H-antimagic Total graph on Establishing Stream Cipher

(2019-07-12)

This paper is aimed to study the use of super (a; d)-H antimagic total graph on generating en-
cryption keys that can be used to establish a stream cipher. Methodology to achieve this goal
was undertaken in three steps. ...

#### Super local edge antimagic total coloring of Pn . H

(2018-07-04)

In this paper, we consider that all graphs are ¯nite, simple and connected.
Let G(V; E) be a graph of vertex set V and edge set E. A bijection f : V (G) ¡!
f1; 2; 3; :::; jV (G)jg is called a local edge antimagic labeling ...

#### The Connected and Disjoint Union of Semi Jahangir Graphs Admit a Cycle-Super (a, d)-Atimagic Total Labeling

(2018-02-28)

We assume that all graphs in this paper are ﬁnite, undirected and no loop and multiple
edges. Given a graph G of order p and size q.LetH
,H be subgraphs of G.ByH
-covering,
we mean every edge in E(G) belongs to at ...

#### P2 ▷ H-super antimagic total labeling of comb product of graphs

(2018-04-12)

Let L and H be two simple, nontrivial and undirected graphs. Let o be a vertex of H, the comb product between L and H,
denoted by L ▷ H, is a graph obtained by taking one copy of L and |V(L)| copies of H and grafting the ...

#### A study of local domination number of Sn H graph

(2018-02-28)

All graphs in this paper are undirected, connected and simple graph. Let G = (V,E) be a graph of order |V| and size |E|. We define a set D as a dominating set if for every vertex μ epsilon V – D is adjacent to some vertex ...

#### The non-isolated resolving number of k-corona product of graphs

(2018-07-04)

Let all graphs be a connected and simple graph. A set W = fw
g
of veretx set of G, the kvector ordered r(vjW) = (d(x; w
1
); d(x; w
2
1
; w
2
); : : : ; d(x; w
)) of is a
representation of v with respect to W, ...

#### The Construction of P2⊳H- antimagic graph using smaller edge - antimagic vertex labeling

(2018-07-04)

In this paper we use simple and non trivial graph. If there exist a
bijective function g : V (G) [ E(G) ! f1; 2; : : : ; jV (G)j + jE(G)jg, such that for all
subgraphs P
2
B H of G isomorphic to H, then graph G is ...