Wszystkie pola: (a,d)-antimagic labeling - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Vertex-antimagic total labelings of graphs
Autorzy:: Bača, Martin
MacDougall, James
Bertault, François
Miller, Mirka
Simanjuntak, Rinovia
Slamin, ---
Powiązania:: https://bibliotekanauki.pl/articles/972037.pdf
Data publikacji:: 2003
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: super-magic labeling
(a,d)-vertex-antimagic total labeling
(a,d)-antimagic labeling
Opis:: In this paper we introduce a new type of graph labeling for a graph G(V,E) called an (a,d)-vertex-antimagic total labeling. In this labeling we assign to the vertices and edges the consecutive integers from 1 to |V|+|E| and calculate the sum of labels at each vertex, i.e., the vertex label added to the labels on its incident edges. These sums form an arithmetical progression with initial term a and common difference d.
We investigate basic properties of these labelings, show their relationships with several other previously studied graph labelings, and show how to construct labelings for certain families of graphs. We conclude with several open problems suitable for further research.
Źródło:: Discussiones Mathematicae Graph Theory; 2003, 23, 1; 67-83
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Survey of certain valuations of graphs
Autorzy:: Bača, Martin
MacDougall, J.
Miller, Mirka
Slamin, ---
Wallis, W.
Powiązania:: https://bibliotekanauki.pl/articles/972036.pdf
Data publikacji:: 2000
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: (a,d)-antimagic labeling
(a,d)-face antimagic labeling
edge-magic total labeling
vertex-magic total labeling
Opis:: The study of valuations of graphs is a relatively young part of graph theory. In this article we survey what is known about certain graph valuations, that is, labeling methods: antimagic labelings, edge-magic total labelings and vertex-magic total labelings.
Źródło:: Discussiones Mathematicae Graph Theory; 2000, 20, 2; 219-229
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: On super (a,d)-edge antimagic total labeling of certain families of graphs
Autorzy:: Roushini Leely Pushpam, P.
Saibulla, A.
Powiązania:: https://bibliotekanauki.pl/articles/743252.pdf
Data publikacji:: 2012
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: edge weight
magic labeling
antimagic labeling
ladder
fan graph
prism and web graph
Opis:: A (p, q)-graph G is (a,d)-edge antimagic total if there exists a bijection f: V(G) ∪ E(G) → {1, 2,...,p + q} such that the edge weights Λ(uv) = f(u) + f(uv) + f(v), uv ∈ E(G) form an arithmetic progression with first term a and common difference d. It is said to be a super (a, d)-edge antimagic total if the vertex labels are {1, 2,..., p} and the edge labels are {p + 1, p + 2,...,p + q}. In this paper, we study the super (a,d)-edge antimagic total labeling of special classes of graphs derived from copies of generalized ladder, fan, generalized prism and web graph.
Źródło:: Discussiones Mathematicae Graph Theory; 2012, 32, 3; 535-543
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 4.

Tytuł:: On Super $(a, d)$-$H$-Antimagic Total Covering of Star Related Graphs
Autorzy:: Kathiresan, K.M.
Laurence, S. David
Powiązania:: https://bibliotekanauki.pl/articles/31234087.pdf
Data publikacji:: 2015-11-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: super (a
d)-H-antimagic total labeling
star
Opis:: Let $G = (V (G), E (G))$ be a simple graph and $H$ be a subgraph of $G$. $G$ admits an $H$-covering, if every edge in $E(G)$ belongs to at least one subgraph of $G$ that is isomorphic to $H$. An $(a, d)$-$H$-antimagic total labeling of $G$ is a bijection $ \lambda : V (G) \cup E(G) \rightarrow {1, 2, 3, . . ., |V (G)| + |E(G)|}$ such that for all subgraphs $ H^' $ isomorphic to $H$, the $H^′$ weights $ wt(H^') = \sum_{v \in V (H^') } \lambda (v) + \sum_{e \in E(H^')} \lambda (e) $ constitute an arithmetic progression $a$, $a+d$, $a+2d$, . . ., $a+(n−1)d$ where $a$ and $d$ are positive integers and $n$ is the number of subgraphs of $G$ isomorphic to $H$. Additionally, the labeling $ \lambda $ is called a super $(a, d)$-$H$-antimagic total labeling if $ \lambda (V (G)) = {1, 2, 3, . . ., |V (G)|} $. In this paper we study super $(a, d)-H$-antimagic total labelings of star related graphs $ G_u[S_n]$ and caterpillars.
Źródło:: Discussiones Mathematicae Graph Theory; 2015, 35, 4; 755-764
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 5.

Tytuł:: On super edge-antimagic total labeling of subdivided stars
Autorzy:: Javaid, Muhammad
Powiązania:: https://bibliotekanauki.pl/articles/30148713.pdf
Data publikacji:: 2014-11-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: subdivision of star
super ($a, d$)-EAT labeling
Opis:: In 1980, Enomoto et al. proposed the conjecture that every tree is a super ($a, 0$)-edge-antimagic total graph. In this paper, we give a partial support for the correctness of this conjecture by formulating some super ($a, d$)-edge-antimagic total labelings on a subclass of subdivided stars denoted by $T(n, n + 1, 2n + 1, 4n + 2, n_5, n_6, . . ., n_r)$ for different values of the edge-antimagic labeling parameter $d$, where $n ≥ 3$ is odd, $n_m = 2^{m−4}(4n+1)+1, r ≥ 5$ and $5 ≤ m ≤ r$.
Źródło:: Discussiones Mathematicae Graph Theory; 2014, 34, 4; 691-706
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja