CSpace  > 数学所
Intersection number and stability of some inscribable graphs
Liu, Jinsong1,2; Zhou, Ze1,3
AbstractA planar graph is inscribable if it is combinatorial equivalent to the skeleton of an inscribed polyhedron in the unit sphere . Giving an inscribable graph, in its combinatorial equivalent class if we could also find a polyhedron inscribed in each convex surface sufficiently close to the unit sphere , then we call such an inscribable graph a stable one. By combining the Teichmuller theory of packings with differential topology method, in this paper we shall investigate the stability of some inscribable graphs.
KeywordInscribable graph Stability Intersection number Circle pattern
Funding ProjectNSFC of China[11471318]
WOS Research AreaMathematics
WOS SubjectMathematics
WOS IDWOS:000387669100005
Citation statistics
Document Type期刊论文
Corresponding AuthorLiu, Jinsong
Affiliation1.Chinese Acad Sci, Inst Math, AMSS, Beijing, Peoples R China
2.Chinese Acad Sci, Hua Loo Keng Key Lab Math, Beijing, Peoples R China
3.Hunan Univ, Coll Math & Econometr, Changsha, Hunan, Peoples R China
Recommended Citation
GB/T 7714
Liu, Jinsong,Zhou, Ze. Intersection number and stability of some inscribable graphs[J]. GEOMETRIAE DEDICATA,2016,185(1):105-121.
APA Liu, Jinsong,&Zhou, Ze.(2016).Intersection number and stability of some inscribable graphs.GEOMETRIAE DEDICATA,185(1),105-121.
MLA Liu, Jinsong,et al."Intersection number and stability of some inscribable graphs".GEOMETRIAE DEDICATA 185.1(2016):105-121.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Liu, Jinsong]'s Articles
[Zhou, Ze]'s Articles
Baidu academic
Similar articles in Baidu academic
[Liu, Jinsong]'s Articles
[Zhou, Ze]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Liu, Jinsong]'s Articles
[Zhou, Ze]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.