Site-specific Gordian distances of spatial graphs
Site-specific Gordian distances of spatial graphs
复制标题
空间图的特定地点戈尔迪距离
DOI:
10.1142/s0218216521410169
复制
发表时间:
2021
影响因子:
0.5
通讯作者:
Kouki Taniyama
中科院分区:
文献类型:
--
作者:
Kouki Taniyama
A site-specific Gordian distance between two spatial embeddings of an abstract graph is the minimal number of crossing changes from one to another where each crossing change is performed between two previously specified abstract edges of the graph. It is infinite in some cases. We determine the site-specific Gordian distance between two spatial embeddings of an abstract graph in certain cases. It has an application to puzzle ring problem. The site-specific Gordian distances between Milnor links and trivial links are determined. We use covering space theory for the proofs.
登录
查看更多内容
DOI:
10.1007/978-1-4612-4066-2_1
发表时间:
1996
期刊:
--
影响因子:
--
作者:
L. Kauffman
通讯作者:
L. Kauffman
影响因子:
4.9
作者:
R. Bing
通讯作者:
R. Bing
DOI:
10.1090/s0002-9939-01-06093-2
发表时间:
2000
期刊:
--
影响因子:
--
作者:
J. Przytycki;Adam S. Sikora
通讯作者:
Adam S. Sikora
影响因子:
2.5
作者:
M. Scharlemann;A. Thompson
通讯作者:
A. Thompson
DOI:
--
发表时间:
1969
期刊:
影响因子:
--
作者:
W. K. Mason
通讯作者:
W. K. Mason