【离散数学】 SEU - 22 - 2021/05/21 - Planar Graph

Discrete Mathematics and its Applications (8th Edition)
2021/05/21 - Planar Graph


10 Graphs

10.7 Planar Graph

10.7.3 Kuratowski’s Theorem

A graph is nonplanar if and only if it contains a subgraph homeomorphic to K 3 , 3 K_{3,3} K3,3 or K 5 K_5 K5.

11 Trees

11.1 Introduction to Trees

A tree is a connected undirected graph with no simple circuits.

An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices.

Tree
A rooted tree is a tree in which one vertex has been designated as the root and every edge is directed away from the root.


ALL RIGHTS RESERVED © 2021 Teddy van Jerry
This blog is licensed under the CC 4.0 Licence.


See also

Teddy van Jerry’s Personal Homepage
Teddy van Jerry’s CSDN Homepage
Teddy van Jerry’s GitHub Homepage

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值