论图的矩阵乘积分解
On Matrix Product Factorization of graphs
AI总结:
该研究围绕图的矩阵乘积分解展开,明确了可分解的完全图、完全二部图的形式,同时指出几类不存在此类分解的图族,丰富了图的矩阵乘积相关理论。
摘要:
本文探讨了由Prasad、Sudhakara、Sujatha与M. Vinay最初提出的“图的矩阵乘积”概念。该运算涉及将两个带有指定标记的图的邻接矩阵相乘,得到一个加权有向图。我们的核心研究重点是识别可表示为另外两个图的图矩阵乘积的图。值得注意的是,我们证明了符合该框架的唯一完全图是$K_{4n+1}$,且其分解不唯一。此外,可表示为另外两个图的图矩阵乘积的唯一完全二部图是$K_{2n,2m}$。我们还介绍了几类存在此类分解的图族,反之也给出了几类不存在任何分解的图族,包括轮图、友谊图、超立方体和路径图。
英文摘要:
In this paper, we explore the concept of the ``matrix product of graphs," initially introduced by Prasad, Sudhakara, Sujatha, and M. Vinay. This operation involves the multiplication of adjacency matrices of two graphs with assigned labels, resulting in a weighted digraph. Our primary focus is on identifying graphs that can be expressed as the graphical matrix product of two other graphs. Notably, we establish that the only complete graph fitting this framework is $K_{4n+1}$, and moreover the factorization is not unique. In addition, the only complete bipartite graph that can be expressed as the graphical matrix product of two other graphs is $K_{2n,2m}$ Furthermore, we introduce several families of graphs that exhibit such factorization and, conversely, some families that do not admit any factorization such as wheel graphs, friendship graphs, hypercubes and paths.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。