CSpace  > 数学所
Intersection number and stability of some inscribable graphs
Liu, Jinsong1,2; Zhou, Ze1,3
2016-12-01
发表期刊GEOMETRIAE DEDICATA
ISSN0046-5755
卷号185期号:1页码:105-121
摘要A 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.
关键词Inscribable graph Stability Intersection number Circle pattern
DOI10.1007/s10711-016-0170-4
语种英语
资助项目NSFC of China[11471318]
WOS研究方向Mathematics
WOS类目Mathematics
WOS记录号WOS:000387669100005
出版者SPRINGER
引用统计
文献类型期刊论文
条目标识符http://ir.amss.ac.cn/handle/2S8OKBNM/24106
专题数学所
通讯作者Liu, Jinsong
作者单位1.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
推荐引用方式
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.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Liu, Jinsong]的文章
[Zhou, Ze]的文章
百度学术
百度学术中相似的文章
[Liu, Jinsong]的文章
[Zhou, Ze]的文章
必应学术
必应学术中相似的文章
[Liu, Jinsong]的文章
[Zhou, Ze]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。