Temat: MAGIC - Katalog OPAC zbiorów

Skocz do pozycji: 1.

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: 2.

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ł

Informacja