Abstract. In this paper, we give a digital graph-theoretical ap-proach of the study of digital images with relation to a simpli-cial complex. Thus, a digital graph Gk with some k-adjacency in Zn can be recognized by the simplicial complex spanned by Gk. Moreover, we demonstrate that a graphically (k0, k1)-continuous map f: Gk0 ⊂ Zn0 → Gk1 ⊂ Zn1 can be converted into the simplicial map S(f) : S(Gk0) → S(Gk1) with relation to combi-natorial topology. Finally, if Gk0 is not (k0, 3 n0 − 1)-homotopy equivalent to SCn0,43n0−1, a graphically (k0, k1)-continuous map (re-spectively a graphically (k0, k1)-isomorphisim) f: Gk0 ⊂ Zn0 → Gk1 ⊂ Zn1 induces the group homomorphism (respectively the group isomorphisim)S(f) ∗ : pi1(S(Gk0), v0) → pi1(S(Gk1),...
We introduce a method to reduce the study of the topology of a simplicial complex to that of a simpl...
Graphs of groups with length functions are defined to parametrize simplicial Gtrees. Collapses of gr...
In classical graph signal processing (GSP), the underlying topological structures are restricted in ...
A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up...
A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up...
A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up...
We expose some basic concepts of combinatorial topology (simplicial complex, polyhedron, simplicial ...
We expose some basic concepts of combinatorial topology (simplicial complex, polyhedron, simplicial ...
International audienceIn this article, a tractable modus operandi is proposed to model a (binary) di...
We present an algorithm for computing [X,Y], i.e., all homotopy classes of continuous maps X → Y, wh...
In this paper we prove results relating to two homotopy relations and four homology theories develop...
AbstractThis paper presents a set of tools to compute topological information of simplicial complexe...
AbstractA simplicial scheme is a certain structure which can be defined on graphs. The purpose of th...
International audienceIn this article, a tractable modus operandi is proposed to model a (binary) di...
Persistent homology is a branch of computational topology which uses geometry and topology for shape...
We introduce a method to reduce the study of the topology of a simplicial complex to that of a simpl...
Graphs of groups with length functions are defined to parametrize simplicial Gtrees. Collapses of gr...
In classical graph signal processing (GSP), the underlying topological structures are restricted in ...
A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up...
A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up...
A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up...
We expose some basic concepts of combinatorial topology (simplicial complex, polyhedron, simplicial ...
We expose some basic concepts of combinatorial topology (simplicial complex, polyhedron, simplicial ...
International audienceIn this article, a tractable modus operandi is proposed to model a (binary) di...
We present an algorithm for computing [X,Y], i.e., all homotopy classes of continuous maps X → Y, wh...
In this paper we prove results relating to two homotopy relations and four homology theories develop...
AbstractThis paper presents a set of tools to compute topological information of simplicial complexe...
AbstractA simplicial scheme is a certain structure which can be defined on graphs. The purpose of th...
International audienceIn this article, a tractable modus operandi is proposed to model a (binary) di...
Persistent homology is a branch of computational topology which uses geometry and topology for shape...
We introduce a method to reduce the study of the topology of a simplicial complex to that of a simpl...
Graphs of groups with length functions are defined to parametrize simplicial Gtrees. Collapses of gr...
In classical graph signal processing (GSP), the underlying topological structures are restricted in ...