Intrinsically Knotted and 3-Linked Graph

Qiu Ping Ren; Guang Hui Wang

doi:10.4028/www.scientific.net/AMR.945-949.2451

Paper Titles

Based on SVM Classification of Connection Pools Algorithm
p.2435

A Buffer Pool Optimization Algorithm Based on Max-Heap
p.2439

Matrix Analysis and Design Based on Algorithm of Paper Analysis
p.2443

Speech Signal for the Recognition of Emotion by Cultural Genetic Algorithm
p.2447

Intrinsically Knotted and 3-Linked Graph
p.2451

Research and Implementation of Multidimensional Customer Behavior Segmentation Model Based on Bayes and Fisher
p.2455

The Random Walk Model for Tibetan Network Public Opinion Dissemination Behavior
p.2459

Two Differential-Integral Inequalities in Engineering
p.2463

Estimation of Unknown Function in a Class of Singular Difference Inequality in Engineering
p.2467

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 945-949Intrinsically Knotted and 3-Linked Graph

Intrinsically Knotted and 3-Linked Graph

Abstract:

Intrinsically linked graphs are very important spatial graphs. We say that is intrinsically knotted and 3-linked graph if every spatial embedding of this graph contains nontrivial knot and a non-split 3-component link. This paper exhibit a new intrinsically knotted and 3-linked graph. This paper is devoted to the operation of the exchanges preserve intrinsically knotted and 3-linked graph.

You might also be interested in these eBooks

Advances in Manufacturing Science and Engineering V

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 945-949)

Pages:

2451-2454

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.945-949.2451

Citation:

Cite this paper

Online since:

June 2014

Authors:

Qiu Ping Ren*, Guang Hui Wang

Keywords:

Intrinsically Knotted and 3-Linked Graph, Intrinsically Linked Graph, Spatial Graphs

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] J. Conway, C. Gordon: Knots and links in spatial graphs, J. Graph Theory, vol. 7(1983), pp.445-453.

DOI: 10.1002/jgt.3190070410

Google Scholar

[2] J. Foisy: A newly recognized intrinsically knotted graphs, J. Graph Theory, vol. 43(2003) , pp.199-209.

DOI: 10.1002/jgt.10114

Google Scholar

[3] T. Fleming, A. Diesl. Intrinsically Linked Graphs and Even Linking Number. Alg. Geom. Top. 2005, 55(5): 1419~1432.

DOI: 10.2140/agt.2005.5.1419

Google Scholar

[4] M. Shimabara. Knots in Certain Spatial Graphs. Tokyo J. Math. 1988, 11(2): 405~413.

DOI: 10.3836/tjm/1270133985

Google Scholar

[5] E. Flapan. Intrinsic Knotting and Linking of Complete Graphs. Algebr. Geom. Topol. 2002, 2(17): 371~380.

DOI: 10.2140/agt.2002.2.371

Google Scholar

[6] B. Johnson, M. E. Kidwell and T. S. Michael: Intrinsically knotted graphs have at least 21edges, J. Knot Theory Ramifications, vol. 19(2010). pp.1423-1429.

DOI: 10.1142/s0218216510008455

Google Scholar

[7] Ren Qiuping: One of edge-disjoint linked Graphs with knotted components, J. of Science & Technology Review, vol. 27(2009) . pp.99-101.

Google Scholar