arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.04150math.COcs.DM
收藏

矩阵乘积分解的谱方法

Spectral Methods for Matrix Product Factorization

Saieed Akbari, Yi-Zheng Fan, Fu-Tao Hu, Babak Miraftab, Yi Wang

AI总结:

本文利用谱方法研究图矩阵乘积分解的连通性、二部性与正则性,证明树不可分解,回答了 Maghsoudi 等人提出的问题。

摘要:

若存在图 $G$、$H$ 和 $K$ 的邻接矩阵 $A$、$B$ 和 $C$,使得 $A = BC$,则称图 $G$ 通过矩阵乘积分解为图 $H$ 和 $K$。本文研究图矩阵乘积的谱性质,包括正则性、二部性和连通性。我们证明,若图 $G$ 分解为一个连通图 $H$ 和一个无孤立顶点的图 $K$,则某些性质成立。若 $H$ 非二部,则 $G$ 连通。若 $H$ 为二部且 $G$ 不连通,则 $K$ 是正则二部图,因此 $n$ 为偶数。进一步,我们证明树不可分解,这回答了 Maghsoudi 等人提出的一个问题。

英文摘要:

A graph $G$ is factored into graphs $H$ and $K$ via a matrix product if there exist adjacency matrices $A$, $B$, and $C$ of $G$, $H$, and $K$, respectively, such that $A = BC$. In this paper, we study the spectral aspects of the matrix product of graphs, including regularity, bipartiteness, and connectivity. We show that if a graph $G$ is factored into a connected graph $H$ and a graph $K$ with no isolated vertices, then certain properties hold. If $H$ is non-bipartite, then $G$ is connected. If $H$ is bipartite and $G$ is not connected, then $K$ is a regular bipartite graph, and consequently, $n$ is even. Furthermore, we show that trees are not factorizable, which answers a question posed by Maghsoudi et al.

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

↑