搜索结果: 1-1 共查到“库存论 Graphs”相关记录1条 . 查询时间(0.075 秒)
Well-covered and uniformly well-covered graphs
Well-covered graph uniformly well-covered graph maximal independent set
2010/12/13
A graph G is called well-covered if all maximal independent sets of vertices have the same cardinality. A well-covered graph G is called uniformly well-covered if there is a partition of the set of ve...