Zobrazeno 1 - 10
of 138
pro vyhledávání: '"Ika Hesti Agustin"'
Publikováno v:
Cauchy: Jurnal Matematika Murni dan Aplikasi, Vol 7, Iss 1, Pp 64-72 (2021)
All graph in this paper are simple, finite, and connected. Let be a labeling of a graph . The function is called antimagic rainbow edge labeling if for any two vertices and , all internal vertices in path have different weight, where the weight of ve
Externí odkaz:
https://doaj.org/article/b46d3ca7833b4d9799ebe3dac5a462f2
Publikováno v:
Cauchy: Jurnal Matematika Murni dan Aplikasi, Vol 6, Iss 1, Pp 10-17 (2019)
The local adjacency metric dimension is one of graph topic. Suppose there are three neighboring vertex , , in path . Path is called local if where each has representation: a is not equals and may equals to . Let’s say, . For an order set of vertice
Externí odkaz:
https://doaj.org/article/b774f965fc2948bc82af27145c4cdb4c
Publikováno v:
Cauchy: Jurnal Matematika Murni dan Aplikasi, Vol 6, Iss 1, Pp 27-33 (2019)
Chaos game is a game of drawing a number of points in a geometric shape using certain rules that are repeated iteratively. Using those rules, a number of points generated and form some pattern. The original chaos game that apply to three vertices yie
Externí odkaz:
https://doaj.org/article/e6211ccd16a543fe80c6c68a5019bd24
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 16, Iss 2, Pp 163-171 (2019)
Let and be two simple, nontrivial and undirected graphs. Let be a vertex of , the comb product between and , denoted by , is a graph obtained by taking one copy of and copies of and grafting the th copy of at the vertex to the th vertex of . By defin
Externí odkaz:
https://doaj.org/article/ab4cee71c6f24ca284a8c6d868f9b006
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 16, Iss 2, Pp 163-171 (2019)
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 ith copy of H at the vertex o
Externí odkaz:
https://doaj.org/article/933685f230984039ad31a7ff625c368a
Publikováno v:
Indonesian Journal of Combinatorics, Vol 3, Iss 1, Pp 14-23 (2019)
This paper is aimed to study the use of super (a, d)-H antimagic total graph on generating encryption keys that can be used to establish a stream cipher. Methodology to achieve this goal was undertaken in three steps. First of all the existence of su
Externí odkaz:
https://doaj.org/article/b4e01c71b530475fb73f76fd63fe3b43
Publikováno v:
Cauchy: Jurnal Matematika Murni dan Aplikasi, Vol 5, Iss 3, Pp 88-94 (2018)
Let be a simple, finite, and connected graph. An ordered set of vertices of a nontrivial connected graph is and the -vector represent vertex that respect to , where and is the distance between vertex and for . The set called a resolving set for if di
Externí odkaz:
https://doaj.org/article/aae7b530862c49ef84b829c0675ea5d7
Publikováno v:
Heliyon, Vol 7, Iss 5, Pp e06991- (2021)
A function f with domain and range are respectively the edge set of graph G and natural number up to ke, and a function f with domain and range are respectively the vertex set of graph G and the even natural number up to 2kv are called a total k-labe
Externí odkaz:
https://doaj.org/article/ef2563dcebc64723a873337f2043784a
Publikováno v:
Cauchy: Jurnal Matematika Murni dan Aplikasi, Vol 4, Iss 4, Pp 146-154 (2017)
All graph in this paper are finite, simple and undirected. Let G, H be two graphs. A graph G is said to be an (a,d)-H-antimagic total graph if there exist a bijective function such that for all subgraphs H’ isomorphic to H, the total H-weights form
Externí odkaz:
https://doaj.org/article/b5b4dff51bd247fd92d927e7c7554f85
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 2019 (2019)
A simple graph G=(V,E) is said to be an H-covering if every edge of G belongs to at least one subgraph isomorphic to H. A bijection f:V∪E→{1,2,3,…,V+E} is an (a,d)-H-antimagic total labeling of G if, for all subgraphs H′ isomorphic to H, the
Externí odkaz:
https://doaj.org/article/fbac3904a7f94e019ed2d4bf143e240b