Search
Now showing items 21-30 of 33
On r-dynamic coloring of some graph operations
(2018-03-07)
Let G be a simple, connected and undirected graph. Given r; k as any natural numbers. By an
r-dynamic k-coloring of graph G, we mean a proper k-coloring c(v) of G such that jc(N(v))j
minfr; d(v)g for each vertex v in ...
Bound of Distance Domination Number of Graph and Edge Comb Product Graph
(2017-09-11)
Let G =(V, E) be a simple, nontrivial, finite, 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 ...
The Antimagicness of Super (a, d) - P2⊵̇H Total Covering on Total Comb Graphs
(2018-10-29)
A graph can be constructed in several ways. One of them is by operating two or more graphs. The resulting graphs will
be a new graph which has certain characteristics. One of the latest graph operations is total comb of ...
On Super Local Antimagic Total Edge Coloring of Some Wheel Related Graphs
(2018-10-29)
Let G be a connected graph, let V(G) be the vertex set of graph G, and let
E(G) be the edge set of graph G. Thus, the
bijective function f : V(G) ∪ E(G) −→ {1, 2, 3, ..., |V(G)| + |E(G)|} is called a local antimagic ...
Non-Isolated Resolving Number of Graphs with Homogeneous Pendant Edges
(2018-10-29)
A set is called a resolving set of if every vertices of have
diff erent r epr esentation. The minimum cardinalit y of resolving set is metric dimension, denoted by .
Furthermore, the resolving set of is called ...
The Effect of Using Synectics Model on Creative Thinking and Metacognition Skills of Junior High School Students
(International Journal of Instruction, July 2019, Vol.12, No.3, 2019-07-01)
This study aims (a) to determine the effect of synectics model on creative thinking
skill (b) to determine the effect of synectics model on metacognition skill. (c) to
find out the relationship between creative thinking ...
On Super Edge Local Antimagic Total Labeling by Using an Edge Antimagic Vertex Labeling Technique
(2019-07-25)
In this paper, we consider that all graphs are finite, simple and connected. Let G(V,E) be a graph of vertex set V and edge set E. By a edge local antimagic total labeling, we mean a bijection f:V(G)∪E(G)→{1,2,3,...,|V(G)|+|E(G)|} ...
Non-Isolated Resolving Number of Graph with Pendant Edges
(2019-07-25)
We consider V; E are respectively vertex and edge sets of a simple, nontrivial and connected graph
G. For an ordered set W = fw
g of vertices and a vertex v 2 G, the ordered
r(vjW) = (d(v; w
1
); d(v; w
2
1
; w
2
; ...
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. ...
The Local Multiset Dimension of Graphs
(2019-09-02)
All graphs in this paper are nontrivial and connected graph. For 𝑘-ordered set 𝑊 = {𝑠1, 𝑠2, … , 𝑠𝑘} of vertex set 𝐺, the multiset representation
of
a
vertex
𝑣
of
𝐺
with
respect
to
𝑊
is
𝑟𝑚(𝑣|𝑊)
= ...