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

关于图的合成与冠积的固定集

On fixing sets of composition and corona product of graphs

I. Javaid, M. S. Aasi, I. Irshad, M. Salman

摘要:

图$G$的固定集$\mathcal{F}$是图$G$的那些顶点的集合,当被分配不同的标签时,这些顶点从图中移除除了平凡的自同构之外的所有自同构。图$G$的固定数,记为$fix(G)$,是$G$的固定集的最小基数。本文研究了两个阶分别为$m$和$n$的图$G_1$和$G_2$的合成积$G_1[G_2]$和冠积$G_1 \odot G_2$的固定数.我们表明,对于连通图$G_1$和任意图$G_2$有$l\geq 1$组件$G_2^1$,$G_2^2$,. $G_2^l,$ $mn-1\geq fix(G_1[G_2])\geq m\left(\sum \limits_{i=1}^{l} fix(G_2^i )\right)$。对于连通图$G_1$和任意非对称图$G_2$,证明了$fix(G_1\odot G_2)=m fix( G_2)$ .进一步,对任意连通图$G_{1}$和任意连通图$G_{2}$,证明了$fix(G_1\odot G_2)= max\{fix(G_1), m fix(G_2)\}$ .

英文摘要:

A fixing set $\mathcal{F}$ of a graph $G$ is a set of those vertices of the graph $G$ which when assigned distinct labels removes all the automorphisms from the graph except the trivial one. The fixing number of a graph $G$, denoted by $fix(G)$, is the smallest cardinality of a fixing set of $G$. In this paper, we study the fixing number of composition product, $G_1[G_2]$ and corona product, $G_1 \odot G_2$ of two graphs $G_1$ and $G_2$ with orders $m$ and $n$ respectively. We show that for a connected graph $G_1$ and an arbitrary graph $G_2$ having $l\geq 1$ components $G_2^1$, $G_2^2$, ... $G_2^l,$ $mn-1\geq fix(G_1[G_2])\geq m\left(\sum \limits_{i=1}^{l} fix(G_2^i )\right)$. For a connected graph $G_1$ and an arbitrary graph $G_2$, which are not asymmetric, we prove that $fix(G_1\odot G_2)=m fix( G_2)$. Further, for an arbitrary connected graph $G_{1}$ and an arbitrary graph $G_{2}$ we show that $fix(G_1\odot G_2)= max\{fix(G_1), m fix(G_2)\}$.

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

↑