Related papers: Homomorphisms of connectome graphs
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
We extend the notion of graph homomorphism to cellularly embedded graphs (maps) by designing operations on vertices and edges that respect the surface topology; we thus obtain the first definition of map homomorphism that preserves both the…
Graph classification plays an important role is data mining, and various methods have been developed recently for classifying graphs. In this paper, we propose a novel method for graph classification that is based on homotopy equivalence of…
For simple graphs $G$ and $H$, the Hom complex $\mathrm{Hom}(G,H)$ is a polyhedral complex whose vertices are the graph homomorphisms $G\to H$ and whose edges connect the pairs of homomorphisms which differ in a single vertex of $G$. Hom…
Signed graphs are studied since the middle of the last century. Recently, the notion of homomorphism of signed graphs has been introduced since this notion captures a number of well known conjectures which can be reformulated using the…
A relational structure is (connected-)homogeneous if every isomorphism between finite (connected) substructures extends to an automorphism of the structure. We investigate notions which generalise (connected-)homogeneity, where…
We compute numerically the homology of several graph complexes in low loop orders, extending previous results.
Homomorphically full graphs are those for which every homomorphic image is isomorphic to a subgraph. We extend the definition of homomorphically full to oriented graphs in two different ways. For the first of these, we show that…
A digraph is connected-homogeneous if every isomorphism between two finite connected induced subdigraphs extends to an automorphism of the whole digraph. In this paper, we completely classify the countable connected-homogeneous digraphs.
Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…
A signed graph is a graph together with an assignment of signs to the edges. A closed walk in a signed graph is said to be positive (negative) if it has an even (odd) number of negative edges, counting repetition. Recognizing the signs of…
This article is devoted to investigations of a structure and homomorphisms of microbundles. Microbundles are generalizations of manifolds. For manifolds it was studied when their families of homomorphism can be supplied with the manifold…
Correspondence homomorphisms are both a generalization of standard homomorphisms and a generalization of correspondence colourings. For a fixed target graph $H$, the problem is to decide whether an input graph $G$, with each edge labeled by…
We introduce a homotopy theory of digraphs (directed graphs) and prove its basic properties, including the relations to the homology theory of digraphs constructed by the authors in previous papers. In particular, we prove the homotopy…
A neighborhood homotopy is an equivalence relation on spatial graphs which is generated by crossing changes on the same component and neighborhood equivalence. We give a complete classification of all 2-component spatial graphs up to…
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…
We classify the finite connected-homogeneous digraphs, as well as the infinite such digraphs with precisely one end. This completes the classification of all the locally finite connected-homogeneous digraphs.
We classify the connected-homogeneous digraphs with more than one end. We further show that if their underlying undirected graph is not connected-homogeneous, they are highly-arc-transitive.
Immersions of graphs to the projective plane are studied. A classification of immersions up to regular homotopy is given. A complete invariant of immersions up to regular homotopy is constructed. Equivalence classes are described.
We enumerate graph homomorphisms to quasi-complete graphs, i.e., graphs obtained from complete graphs by removing one edge. The source graphs are complete graphs, quasi-complete graphs, cycles, paths, wheels and broken wheels. These…