2016/09/08 by Peteris Daugulis, Daugulis, Peteris
Biochemistry, Genetics and Molecular Biology · Computer Science · Mathematics · #05C20 #05C21 #05C40 #92B20 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Biological sciences #FOS: Computer and information sciences #FOS: Mathematics #Neurons and Cognition (q-bio.NC) #cs.DM #math.CO #msc:05C20 #msc:05C21 #msc:05C40 #msc:92B20 #q-bio.NC
paper · pdf · doi:10.48550/arxiv.1609.07355
arxiv created 2016/10/20 · arxiv updated 2016/10/21
Directed graphs are widely used in modelling of nonsymmetric relations in various sciences and engineering disciplines. We discuss invariants of strongly connected directed graphs - minimal number of vertices or edges necessary to remove to make remaining graphs not strongly connected. By analogy with undirected graphs these invariants are called strong vertex/edge connectivities. We review some properties of these invariants. Computational results for some publicly available connectome graphs used in neuroscience are described.