图的乘积的良好覆盖维数
The Well-Covered Dimension of Products of Graphs
摘要：
我们讨论如何找到一个图的覆盖维数，这个图是路，圈，完全图和其他单图的笛卡儿积。此外，良好覆盖的维度的$K_n\times G$的一个界被发现，提供$G$有一个最大的贪婪的独立分解的长度$c<n$。给出了由已知图的顶点爆破得到的图的完全覆盖维数和两个已知图的字典序积的计算公式。
英文摘要：
We discuss how to find the well-covered dimension of a graph that is the Cartesian product of paths, cycles, complete graphs, and other simple graphs. Also, a bound for the well-covered dimension of $K_n\times G$ is found, provided that $G$ has a largest greedy independent decomposition of length $c<n$. Formulae to find the well-covered dimension of graphs obtained by vertex blowups on a known graph, and to the lexicographic product of two known graphs are also given.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
