Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Denny R. Silaban"'
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 9, Iss 2, Pp 485-498 (2021)
Let G(V,E) be a simple graph and f be a bijection f : V ∪ E → {1, 2, …, |V|+|E|} where f(V)={1, 2, …, |V|}. For a vertex x ∈ V, define its weight w(x) as the sum of labels of all edges incident with x and the vertex label itself. Then f is
Externí odkaz:
https://doaj.org/article/28c71e0e5b5142d6ba9184ee94738be7
Autor:
Kiki Ariyanti Sugeng, Denny R. Silaban
Publikováno v:
Indonesian Journal of Combinatorics, Vol 4, Iss 1, Pp 76-81 (2020)
Let G = (V, E) be a finite (non-empty), simple, connected and undirected graph, where V and E are the sets of vertices and edges of G. An edge magic total labeling is a bijection α from V ∪ E to the integers 1, 2, . . . , n + e, with the property
Externí odkaz:
https://doaj.org/article/6dcfbe64ece74241883b8611be338440