arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1104.4556math.AC
收藏

纯单纯复形与良好覆盖图

Pure simplicial complexes and well-covered graphs

Rashid Zaare-Nahandi

摘要:

一个图$G$称为良好覆盖的,如果所有的极大独立顶点集具有相同的基数。单纯复形$Δ$称为纯复形,如果它的所有面都具有相同的基数。设$\mathcal G$是一类图,它具有一些不交的极大团覆盖所有顶点.本文证明了对于任意单纯复形或任意图,在类$\mathcal G$中存在一个相应的图,该图具有相同的良好覆盖性.然后给出了快速识别类$\cal G$中的图是否被覆盖的充分必要条件。为了做这个特征,我们使用代数解释根据零因子元素的边环的图。

英文摘要:

A graph $G$ is called well-covered if all maximal independent sets of vertices have the same cardinality. A simplicial complex $Δ$ is called pure if all of its facets have the same cardinality. Let $\mathcal G$ be the class of graphs with some disjoint maximal cliques covering all vertices. In this paper, we prove that for any simplicial complex or any graph, there is a corresponding graph in class $\mathcal G$ with the same well-coveredness property. Then some necessary and sufficient conditions are presented to recognize fast when a graph in the class $\cal G$ is well-covered or not. To do this characterization, we use an algebraic interpretation according to zero-divisor elements of the edge rings of graphs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑