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

广义Mycielskian图的判别

Distinguishing Generalized Mycielskian Graphs

Debra Boutin, Sally Cockburn, Lauren Keough, Sarah Loeb, K. E. Perry, Puck Rombach

摘要:

一个图$G$是$d$ -可区分的,如果存在一个顶点用$d$颜色着色,使得只有平凡自同构保持颜色类。最小的$d$是可区别数$\operatorname{Dist}(G)$。图$G$的Mycielskian $μ(G)$是通过为$G$的每个顶点$v_i$添加一个阴影顶点$u_i$和一个额外的顶点$w$并添加边使得$N(u_i)~=~N_G(v_i)~\cup~\{w\}$来构造的。广义Mycielskian $μ_t(G)$是一个具有$t$层阴影顶点的Mycielskian图,每个阴影顶点都有到上下层的边。本文研究了传统Mycielskian图和广义Mycielskian图的可区别数。值得注意的是,如果$G~\neq ~K_1,~K_2$且$μ_t(G)$中的孤立顶点的数量至多为$\operatorname{Dist}(G)$,则为$\operatorname{Dist}(μ_t(G)) \le \operatorname{Dist}(G)$。这一结果证明并超越了Alikhani和Soltani的猜想。

英文摘要:

A graph $G$ is $d$-distinguishable if there is a coloring of the vertices with $d$ colors so that only the trivial automorphism preserves the color classes. The smallest such $d$ is the distinguishing number, $\operatorname{Dist}(G)$. The Mycielskian $μ(G)$ of a graph $G$ is constructed by adding a shadow vertex $u_i$ for each vertex $v_i$ of $G$ and one additional vertex $w$ and adding edges so that $N(u_i)~=~N_G(v_i)~\cup~\{w\}$. The generalized Mycielskian $μ_t(G)$ is a Mycielskian graph with $t$ layers of shadow vertices, each with edges to layers above and below. This paper examines the distinguishing number of the traditional and generalized Mycielskian graphs. Notably, if $G~\neq ~K_1,~K_2$ and the number of isolated vertices in $μ_t(G)$ is at most $\operatorname{Dist}(G)$, then $\operatorname{Dist}(μ_t(G)) \le \operatorname{Dist}(G)$. This result proves and exceeds a conjecture of Alikhani and Soltani.

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

↑