Temat: double graphs - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Supermagic Generalized Double Graphs
Autorzy:: Ivančo, Jaroslav
Powiązania:: https://bibliotekanauki.pl/articles/31341097.pdf
Data publikacji:: 2016-02-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: double graphs
supermagic graphs
degree-magic graphs
Opis:: A graph G is called supermagic if it admits a labelling of the edges by pairwise di erent consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we will introduce some constructions of supermagic labellings of some graphs generalizing double graphs. Inter alia we show that the double graphs of regular Hamiltonian graphs and some circulant graphs are supermagic.
Źródło:: Discussiones Mathematicae Graph Theory; 2016, 36, 1; 211-225
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Double domination critical and stable graphs upon vertex removal
Autorzy:: Khelifi, Soufiane
Chellali, Mustapha
Powiązania:: https://bibliotekanauki.pl/articles/743276.pdf
Data publikacji:: 2012
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: double domination
vertex removal critical graphs
vertex removal stable graphs
Opis:: In a graph a vertex is said to dominate itself and all its neighbors. A double dominating set of a graph G is a subset of vertices that dominates every vertex of G at least twice. The double domination number of G, denoted $γ_{×2}(G)$, is the minimum cardinality among all double dominating sets of G. We consider the effects of vertex removal on the double domination number of a graph. A graph G is $γ_{×2}$-vertex critical graph ($γ_{×2}$-vertex stable graph, respectively) if the removal of any vertex different from a support vertex decreases (does not change, respectively) $γ_{×2}$(G). In this paper we investigate various properties of these graphs. Moreover, we characterize $γ_{×2}$-vertex critical trees and $γ_{×2}$-vertex stable trees.
Źródło:: Discussiones Mathematicae Graph Theory; 2012, 32, 4; 643-657
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja