1994
DOI: 10.1016/0012-365x(94)90261-5
|View full text |Cite
|
Sign up to set email alerts
|

Contractible transformations do not change the homology groups of graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

2
53
0

Year Published

1994
1994
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 53 publications
(55 citation statements)
references
References 2 publications
2
53
0
Order By: Relevance
“…Topological properties of K are similar to topological properties of its continuous counterpart. For example, the Euler characteristic and the homology groups of a continuous and a digital Klein bottle are the same ( [7] and [8]). Consider the solution of equation (15) …”
Section: Examplementioning
confidence: 99%
See 1 more Smart Citation
“…Topological properties of K are similar to topological properties of its continuous counterpart. For example, the Euler characteristic and the homology groups of a continuous and a digital Klein bottle are the same ( [7] and [8]). Consider the solution of equation (15) …”
Section: Examplementioning
confidence: 99%
“…A digital space G is a simple undirected graph G=(V,W) where V=(v 1 ,v 2 ,...v n ,…) is a finite or countable set of points, and W = ((v р v q ),....) is a set of edges. The induced subgraph ( )containing point v and all points adjacent to v is called the ball of point v in G. Graphs that are digital counterparts of continuous n-dimensional manifolds were studied in [5,6,7,8]. Consider the numerical solutions of the initial value problem for the wave equation on a graph G(v 1 , v 2 , … v s ).…”
mentioning
confidence: 99%
“…A digital space G is a simple undirected graph G=(V, W) where V=(v 1 , v 2 , ... v n , …) is a finite or countable set of points, and W = ((v р v q ),....) is a set of edges. Topological properties of G as a digital space in terms of adjacency, connectedness and dimensionality are completely defined by set W. Let G and v be a graph and a point of G. In ( [13], [14] For two graphs G=(X, U) and H=(Y, W) with disjoint point sets X and Y, their join G⊕H is the graph that contains G, H and edges joining every point in G with every point in H.…”
Section: Contractible Graphs Homotopy Equivalent Graphs and Contractmentioning
confidence: 99%
“…Contractible graphs and contractible transformations are basic elements in this approach (see [13,14]). …”
Section: Contractible Graphs Homotopy Equivalent Graphs and Contractmentioning
confidence: 99%
See 1 more Smart Citation