On Compact Symmetric Regularizations of Graphs

[摘要] Let $G$ be a finite simple graph of order $n$, maximum degree $\Delta$, and minimum degree $\delta$. A compact regularization of $G$ is a $\Delta$-regular graph $H$ of which $G$ is an induced subgraph: $H$ is symmetric if every automorphism of $G$ can be

[学科分类] 离散数学和组合数学

[关键词] Graph automorphism;regular graph;regularization