全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
Mathematics  2011 

On the number of cut locus structures on graphs

Full-Text   Cite this paper   Add to My Lib

Abstract:

We proved in another paper that every connected graph can be realized as the cut locus of some point on some riemannian surface. Here we give upper bounds on the number of such realizations.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133