简单图论术语问题
这可能是一个显而易见的问题,我一直在寻找但似乎找不到答案。对于只有两个顶点且它们之间只有一条边的图,术语(以及任何替代术语)是什么?
这不是一个家庭作业问题:-)
This is a probably a no brainer, and I've been searching but can't seem to find an answer. What is the term (and any alternate terms) for a graph with only two vertices and only one edge between them?
This is not a homework question :-)
如果你对这篇内容有疑问,欢迎到本站社区发帖提问 参与讨论,获取更多帮助,或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱,如果其他用户或者作者回复了您的评论,将不能在第一时间通知您!
发布评论
评论(3)
2 个顶点的完整图。表示为 K2。请参阅:http://en.wikipedia.org/wiki/Complete_graph
The complete graph on 2 vertices. Denoted K2. See: http://en.wikipedia.org/wiki/Complete_graph
我不知道是否存在确切的术语,但它是一个二分 < a href="http://en.wikipedia.org/wiki/Complete_graph" rel="nofollow noreferrer">完整 平面图 肯定有 2 个顶点。
I don't know if an exact term exists, however it is a bipartite complete planar graph with 2 vertices for sure.
通过进一步阅读,我发现维基百科上的常规图表条目。它似乎是一个“1-正则图”,尽管还有其他图也符合这样的条件。
From further reading I found Regular Graph entry on wikipedia. It would seem to be a "1-regular graph", though there are other graphs which also qualify as such.