Zobrazeno 1 - 10
of 26
pro vyhledávání: '"POKORNÁ, Aneta"'
This work deals with undirected graphs that have the same betweenness centrality for each vertex, so-called betweenness uniform graphs (or BUGs). The class of these graphs is not trivial and its classification is still an open problem. Recently, Gago
Externí odkaz:
http://arxiv.org/abs/2401.00347
The symmetry of complex networks is a global property that has recently gained attention since MacArthur et al. 2008 showed that many real-world networks contain a considerable number of symmetries. These authors work with a very strict symmetry defi
Externí odkaz:
http://arxiv.org/abs/2312.08042
Betweenness centrality is a centrality measure based on the overall amount of shortest paths passing through a given vertex. A graph is betweenness-uniform if all its vertices have the same betweenness centrality. We study the properties of betweenne
Externí odkaz:
http://arxiv.org/abs/2109.10594
Autor:
Pokorná, Aneta
The need to understand the structure of complex networks increases as both their complexity and the dependency of human society on them grows. Network centralities help to recognize the key elements of these networks. Betweenness centrality is a netw
Externí odkaz:
http://www.nusl.cz/ntk/nusl-415123
Autor:
Hartman, David, Pokorná, Aneta
Betweenness centrality is a measure of the importance of a vertex x inside a network based on the fraction of shortest paths passing through x. We study a blow-up construction that has been shown to produce graphs with uniform distribution of between
Externí odkaz:
http://arxiv.org/abs/2105.06777
Publikováno v:
Discrete Mathematics, Volume 344, Issue 5, 2021, 112319
For a digraph $G$ and $v \in V(G)$, let $\delta^+(v)$ be the number of out-neighbors of $v$ in $G$. The Caccetta-H\"{a}ggkvist conjecture states that for all $k \ge 1$, if $G$ is a digraph with $n = |V(G)|$ such that $\delta^+(v) \ge k$ for all $v \i
Externí odkaz:
http://arxiv.org/abs/2101.04716
Publikováno v:
Algorithmica 84(6), 1526-1547, 2022; Proceedings: Graph-Theoretic Concepts in Computer Science, WG 2021
The 3-coloring of hereditary graph classes has been a deeply-researched problem in the last decade. A hereditary graph class is characterized by a (possibly infinite) list of minimal forbidden induced subgraphs $H_1,H_2,\ldots$; the graphs in the cla
Externí odkaz:
http://arxiv.org/abs/2011.06173
Publikováno v:
In Discrete Applied Mathematics 15 January 2024 342:27-37
Autor:
Pokorná, Aneta
This diploma thesis deals with the assessment approach of the country and citizen to the national cultural heritage. For this assessment was selected third least vis-ited region in the Czech Republic-Vysocina region. The aim of the work is the analys
Externí odkaz:
http://www.nusl.cz/ntk/nusl-363010
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.