Zobrazeno 1 - 10
of 383
pro vyhledávání: '"total labeling"'
Publikováno v:
JTAM (Jurnal Teori dan Aplikasi Matematika), Vol 8, Iss 2, Pp 454-464 (2024)
Graph labeling involves mapping the elements of a graph (edges and vertices) to a set of positive integers. The concept of an anti-magic super outer labeling (a,d)-H pertains to assigning labels to the vertices and edges of a graph using natural numb
Externí odkaz:
https://doaj.org/article/63fe9c4aa4d24abb9910afc22420524d
Autor:
Supaporn Saduakdee, Varanoot Khemmani
Publikováno v:
AIMS Mathematics, Vol 8, Iss 11, Pp 27513-27527 (2023)
Let $ G $ be a graph of order $ n $ and size $ m $. A vertex magic total labeling of $ G $ is a one-to-one function $ f $: $ V(G) \cup E(G) \rightarrow \{1, 2, \cdots, n+m\} $ with the property that for each vertex $ u $ of $ G $, the sum of the labe
Externí odkaz:
https://doaj.org/article/4b9c9d3350d146f6b404d13118284ed8
Publikováno v:
Science and Technology Indonesia, Vol 8, Iss 3, Pp 479-485 (2023)
Let H= (T,S), be a finite simple graph, T(H)= T and S(H)= S, respectively, are the sets of vertices and edges on H. Let σ:T∪S→1,2,· · · ,k, be a total k-labeling on H and wσ(x), be a weight of x∈T while using σ labeling, which is evaluate
Externí odkaz:
https://doaj.org/article/0bcd1fefc371457281e09e8a8a48dfe3
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 10, Iss 1, Pp 301-309 (2022)
Suppose G = (V, E) be a simple graph with p vertices and q edges. An edge-magic total labeling of G is a bijection f : V ∪ E → {1, 2, …, p + q} where there exists a constant r for every edge xy in G such that f(x)+f(y)+f(xy)=r. An edge-magic to
Externí odkaz:
https://doaj.org/article/ef8f4b35100e42099e94af9d544274ff
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
IEEE Access, Vol 10, Pp 32394-32405 (2022)
In this article, we address the super edge-antimagic total labeling of the hexagonal lattice $HTT_{m,n}$ and two non-isomorphic forms of prismatic lattice $PTT_{m,n}$ . The aforementioned classes are symmetric lattices involving the finite chain of t
Externí odkaz:
https://doaj.org/article/198bb79edd5947a4a6231f7ada2174f9
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:
Meilin I. Tilukay, Pranaya D. M. Taihuttu, A. N. M. Salman, Francis Y. Rumlawang, Zeth A. Leleury
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 9, Iss 2, Pp 387-395 (2021)
A graph G is called a totally irregular total k-graph if it has a totally irregular total k-labeling λ : V ∪ E→ 1, 2, ... , k, that is a total labeling such that for any pair of different vertices x and y of G, their weights wt(x) and wt(y) are
Externí odkaz:
https://doaj.org/article/fabf42ef21b042daa34f8877ad86afcf
Publikováno v:
Indonesian Journal of Combinatorics, Vol 5, Iss 1, Pp 11-16 (2021)
Let H be a branched-prism graph, denoted by H = (Cm x P2) ⊙ Ǩn for odd m, m ≥ 3 and n ≥ 1. This paper considers about the existence of the super (a,d)-edge antimagic total labeling of H, for some positive integer a and some non-negative intege
Externí odkaz:
https://doaj.org/article/e5e5e9aeb02044c1ade5b490ae795244