Autor: Škrekovski, Riste - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Parity vertex colorings of binomial trees
Autorzy:: Gregor, Petr
Škrekovski, Riste
Powiązania:: https://bibliotekanauki.pl/articles/743737.pdf
Data publikacji:: 2012
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: binomial tree
parity coloring
vertex ranking
Opis:: We show for every k ≥ 1 that the binomial tree of order 3k has a vertex-coloring with 2k+1 colors such that every path contains some color odd number of times. This disproves a conjecture from [1] asserting that for every tree T the minimal number of colors in a such coloring of T is at least the vertex ranking number of T minus one.
Źródło:: Discussiones Mathematicae Graph Theory; 2012, 32, 1; 177-180
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Gallais innequality for critical graphs of reducible hereditary properties
Autorzy:: Mihók, Peter
Skrekovski, Riste
Powiązania:: https://bibliotekanauki.pl/articles/743466.pdf
Data publikacji:: 2001
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: additive induced-hereditary property of graphs
reducible property of graphs
critical graph
Gallai's Theorem
Opis:: In this paper Gallai's inequality on the number of edges in critical graphs is generalized for reducible additive induced-hereditary properties of graphs in the following way. Let $₁,₂,...,ₖ$ (k ≥ 2) be additive induced-hereditary properties, $ = ₁ ∘ ₂ ∘ ... ∘ₖ$ and $δ = ∑_{i=1}^k δ(_i)$. Suppose that G is an -critical graph with n vertices and m edges. Then 2m ≥ δn + (δ-2)/(δ²+2δ-2)*n + (2δ)/(δ²+2δ-2) unless = ² or $G = K_{δ+1}$. The generalization of Gallai's inequality for -choice critical graphs is also presented.
Źródło:: Discussiones Mathematicae Graph Theory; 2001, 21, 2; 167-177
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Hajós theorem for list colorings of hypergraphs
Autorzy:: Benzaken, Claude
Gravier, Sylvain
Skrekovski, Riste
Powiązania:: https://bibliotekanauki.pl/articles/743401.pdf
Data publikacji:: 2003
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: list-coloring
Hajós' construction
hypergraph
Opis:: A well-known theorem of Hajós claims that every graph with chromathic number greater than k can be constructed from disjoint copies of the complete graph $K_{k+1}$ by repeated application of three simple operations. This classical result has been extended in 1978 to colorings of hypergraphs by C. Benzaken and in 1996 to list-colorings of graphs by S. Gravier. In this note, we capture both variations to extend Hajós' theorem to list-colorings of hypergraphs.
Źródło:: Discussiones Mathematicae Graph Theory; 2003, 23, 2; 207-213
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 4.

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