4 papers
Graphlets as structural fingerprints of complex networks
Anna Pidnebesna, David Hartman, Aneta Pokorna +2
Complex networks are often compared using selected graph-theoretical measures that capture a selected set of properties with effects ranging from local to global, such as degree, c…
Reconstructing graphs and their connectivity using graphlets
David Hartman, Aneta Pokorná, Daniel Trlifaj +1
Graphlets are subgraphs rooted at a fixed vertex. The number of occurrences of graphlets aligned to a particular vertex, called graphlet degree sequence (gds), gives a topological…
Structure of betweenness uniform graphs with low values of betweenness centrality
Babak Ghanbari, David Hartman, Vít Jelínek +3
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 t…
Computing approximate symmetries of complex networks
Anna Pidnebesna, David Hartman, Aneta Pokorná +2
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 num…