Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Faisal Susanto"'
Publikováno v:
Discrete Mathematics Letters, Vol 12, Pp 159-165 (2023)
Externí odkaz:
https://doaj.org/article/1f567530531d4b13aaf02fb95d917f62
Publikováno v:
Opuscula Mathematica, Vol 42, Iss 3, Pp 439-458 (2022)
A vertex \(k\)-labeling \(\phi:V(G)\rightarrow\{1,2,\dots,k\}\) on a simple graph \(G\) is said to be a distance irregular vertex \(k\)-labeling of \(G\) if the weights of all vertices of \(G\) are pairwise distinct, where the weight of a vertex is t
Externí odkaz:
https://doaj.org/article/f98e8a77837240eabf6f0a5054d5572c
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 10, Iss 1, Pp 1-13 (2022)
A function ϕ: V(G)→{1, 2, …, k} of a simple graph G is said to be a non-inclusive distance vertex irregular k-labeling of G if the sums of labels of vertices in the open neighborhood of every vertex are distinct and is said to be an inclusive di
Externí odkaz:
https://doaj.org/article/e25eece994fa461e96cfd8319db257a8
Publikováno v:
Heliyon, Vol 7, Iss 10, Pp e08203- (2021)
An (a,d)-H-antimagic total labeling of a simple graph G admitting an H-covering is a bijection φ:V(G)∪E(G)→{1,2,…,|V(G)|+|E(G)|} such that for all subgraphs H′ of G isomorphic to H, the set of H′-weights given by wtφ(H′)=∑v∈V(H′)
Externí odkaz:
https://doaj.org/article/8dc085de30274d9b828cc2b62571a6b2
Autor:
Faisal Susanto
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 15, Iss 1, Pp 22-26 (2018)
Let and be finite simple graphs where every edge of belongs to at least one subgraph that is isomorphic to . An --antimagic total labeling of a graph is a bijection such that for all subgraphs isomorphic to , the -weights, form an arithmetic progress
Externí odkaz:
https://doaj.org/article/5e95f939f577469ab4e6d7e8c720d0de
Autor:
Faisal Susanto
Publikováno v:
Kragujevac Journal of Mathematics. 46:507-523
A distance irregular k-labeling of a graph G is a function f : V (G) → {1, 2, . . . , k} such that the weights of all vertices are distinct. The weight of a vertex v, denoted by wt(v), is the sum of labels of all vertices adjacent to v (distance 1
Publikováno v:
Electronic Journal of Graph Theory and Applications. 10:589
Autor:
Faisal Susanto
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 15, Iss 1, Pp 22-26 (2018)
Let H and G be finite simple graphs where every edge of G belongs to at least one subgraph that is isomorphic to H . An ( a , d ) - H -antimagic total labeling of a graph G is a bijection f : V ( G ) ∪ E ( G ) → { 1 , 2 , … , | V ( G ) | + | E