Autor: Yilma, Zelealem B. - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: A Tight Bound on the Set Chromatic Number
Autorzy:: Sereni, Jean-Sébastien
Yilma, Zelealem B.
Powiązania:: https://bibliotekanauki.pl/articles/30146528.pdf
Data publikacji:: 2013-05-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: chromatic number
set coloring
set chromatic number
neighbor
distinguishing coloring
Opis:: We provide a tight bound on the set chromatic number of a graph in terms of its chromatic number. Namely, for all graphs G, we show that χ_s(G) > ⌈log₂ χ(G)⌉ + 1, where χ_s(G) and χ(G) are the set chromatic number and the chromatic number of G, respectively. This answers in the affirmative a conjecture of Gera, Okamoto, Rasmussen and Zhang.
Źródło:: Discussiones Mathematicae Graph Theory; 2013, 33, 2; 461-465
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Eccentricity of Networks with Structural Constraints
Autorzy:: Krnc, Matjaž
Sereni, Jean-Sébastien
Škrekovski, Riste
Yilma, Zelealem B.
Powiązania:: https://bibliotekanauki.pl/articles/31348091.pdf
Data publikacji:: 2020-11-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: eccentricity
network
bipartite graph
complex network
maximum degree
Opis:: The eccentricity of a node v in a network is the maximum distance from v to any other node. In social networks, the reciprocal of eccentricity is used as a measure of the importance of a node within a network. The associated centralization measure then calculates the degree to which a network is dominated by a particular node. In this work, we determine the maximum value of eccentricity centralization as well as the most centralized networks for various classes of networks including the families of bipartite networks (two-mode data) with given partition sizes and tree networks with fixed number of nodes and fixed maximum degree. To this end, we introduce and study a new way of enumerating the nodes of a tree which might be of independent interest.
Źródło:: Discussiones Mathematicae Graph Theory; 2020, 40, 4; 1141-1162
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja