Homomorphisms of connectome graphs
نویسنده
چکیده
We propose to study homomorphisms of connectome graphs. Homomorphisms can be studied as sequences of elementary homomorphisms folds, which identify pairs of vertices. Several fold types are defined. Initial computation results for some connectome graphs are described.
منابع مشابه
Connectome graphs and maximum flow problems
We propose to study maximum flow problems for connectome graphs. We suggest a few computational problems: finding vertex pairs with maximal flow, finding new edges which would increase the maximal flow. Initial computation results for some publicly available connectome graphs are described.
متن کاملThe Frequent Subgraphs of the Connectome of the Human Brain
In mapping the human structural connectome, we are in a very fortunate situation: one can compute and compare graphs, describing the cerebral connections between the very same, anatomically identified small regions of the gray matter among hundreds of human subjects. The comparison of these graphs has led to numerous recent results, as the (i) discovery that women’s connectomes have deeper and ...
متن کاملGraph homomorphisms: structure and symmetry
This paper is the first part of an introduction to the subject of graph homomorphism in the mixed form of a course and a survey. We give the basic definitions, examples and uses of graph homomorphisms and mention some results that consider the structure and some parameters of the graphs involved. We discuss vertex transitive graphs and Cayley graphs and their rather fundamental role in some asp...
متن کاملExtremal graphs for homomorphisms
The study of graph homomorphisms has a long and distinguished history, with applications in many areas of graph theory. There has been recent interest in counting homomorphisms, and in particular on the question of finding upper bounds for the number of homomorphisms from a graph G into a fixed image graph H. We introduce our techniques by proving that the lex graph has the largest number of ho...
متن کاملStrong connectivity and its applications
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 first...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014