arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1905.09462cs.DMmath.CO
收藏

关于几乎二部图的临界差

On the Critical Difference of Almost Bipartite Graphs

Vadim E. Levit, Eugen Mandrescu

摘要:

一个集合$S\subseteq V$是图$G=\left( V,E\right) $中的\textit{independent},如果没有两个来自$S$的顶点是相邻的。\textit{independence number} $α(G)$是最大独立集的基数,而$μ(G)$是$G$中最大匹配的大小。如果$α(G)+μ(G)$等于$G$的阶数,则$G$称为\textit{König-Egerváry graph } \cite{dem,ster}。数字$d\left( G\right) =\max\{\left\vert A\right\vert -\left\vert N\left( A\right) \right\vert :A\subseteq V\}$被称为$G$ \cite{Zhang}的\textit{critical difference}(其中$N\left( A\right) =\left\{ v:v\in V,N\left( v\right) \cap A\neq\emptyset\right\} $)。已知$α(G)-μ(G)\leq d\left( G\right) $对每个图\cite{Levman2011a,Lorentzen1966,Schrijver2003}都成立。在\cite{LevMan5}中,证明了$d(G)=α(G)-μ(G)$对于每个König-Egerváry图都成立。一个图$G$是\textit{(i)} \textit{unicyclic},如果它有一个唯一的圈,\textit{(ii)} \textit{almost bipartite},如果它只有一个奇数圈。在\cite{LevMan2012a,LevMan2013a}中证明了$d(G)=α(G)-μ(G)$对所有单圈非König-Egerváry图$G$成立,并在\cite{Bhattacharya2018}中得到了验证.本文证明了:若$G$是阶为$n\left( G\right) $的几乎二部图,则$α(G)+μ(G)\in\left\{ n\left( G\right) -1,n\left( G\right) \right\} $ .此外,对于这两个值中的每一个,我们描述了相应的图。此外,利用这些发现,我们表明,几乎二分图$G$的临界差满足\[ d(G)=α(G)-μ(G)=\left\vert \mathrm{core}(G)\right\vert -\left\vert N(\mathrm{core}(G))\right\vert , \],其中\textrm{core} $\left( G\right) $我们的意思是所有最大独立集的交集。

英文摘要:

A set $S\subseteq V$ is \textit{independent} in a graph $G=\left( V,E\right) $ if no two vertices from $S$ are adjacent. The \textit{independence number} $α(G)$ is the cardinality of a maximum independent set, while $μ(G)$ is the size of a maximum matching in $G$. If $α(G)+μ(G)$ equals the order of $G$, then $G$ is called a \textit{König-Egerváry graph }\cite{dem,ster}. The number $d\left( G\right) =\max\{\left\vert A\right\vert -\left\vert N\left( A\right) \right\vert :A\subseteq V\}$ is called the \textit{critical difference} of $G$ \cite{Zhang} (where $N\left( A\right) =\left\{ v:v\in V,N\left( v\right) \cap A\neq\emptyset\right\} $). It is known that $α(G)-μ(G)\leq d\left( G\right) $ holds for every graph \cite{Levman2011a,Lorentzen1966,Schrijver2003}. In \cite{LevMan5} it was shown that $d(G)=α(G)-μ(G)$ is true for every König-Egerváry graph. A graph $G$ is \textit{(i)} \textit{unicyclic} if it has a unique cycle, \textit{(ii)} \textit{almost bipartite} if it has only one odd cycle. It was conjectured in \cite{LevMan2012a,LevMan2013a} and validated in \cite{Bhattacharya2018} that $d(G)=α(G)-μ(G)$ holds for every unicyclic non-König-Egerváry graph $G$. In this paper we prove that if $G$ is an almost bipartite graph of order $n\left( G\right) $, then $α(G)+μ(G)\in\left\{ n\left( G\right) -1,n\left( G\right) \right\} $. Moreover, for each of these two values, we characterize the corresponding graphs. Further, using these findings, we show that the critical difference of an almost bipartite graph $G$ satisfies \[ d(G)=α(G)-μ(G)=\left\vert \mathrm{core}(G)\right\vert -\left\vert N(\mathrm{core}(G))\right\vert , \] where by \textrm{core}$\left( G\right) $ we mean the intersection of all maximum independent sets.

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

↑