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

双块图的指数距离矩阵

The exponential distance matrix of bi-block graphs

Department of Mathematics, College of Engineering and Technology, SRM Institute of Science and Technology(SRM理工学院工程与技术学院数学系);Indian Institute of Management Ranchi(兰契印度管理学院)

Joyentanuj Das, Sumit Mohanty

AI总结:

本文研究了双块图的指数距离矩阵,推导了其行列式、逆矩阵和余子式和的显式表达式,并推广了相关已知结果。

摘要:

设G是一个顶点集为{v₁,v₂,…,vₙ}的连通图。作为经典距离矩阵的一种变体,指数距离矩阵由Yan和Yeh,以及Bapat等人独立引入。对于非零的不定元q,图G的指数距离矩阵F=(F_{ij})_{n×n}由F_{ij}=q^{d_{ij}}定义,其中d_{ij}表示图G中顶点v_i和v_j之间的距离。若图的每个块都是完全二分图,则称该图为双块图。在本文中,我们得到了双块图的指数距离矩阵的行列式、逆矩阵和余子式和的显式表达式。作为结果,一些关于指数距离矩阵和q-拉普拉斯矩阵已知结果得到了推广。

英文摘要:

Let $G$ be a connected graph with vertex set $\{v_1, v_2, \ldots, v_\mathbf{n}\}$. As a variant of the classical distance matrix, the \emph{exponential distance matrix} was introduced independently by Yan and Yeh, and by Bapat et al. For a nonzero indeterminate $q$, the exponential distance matrix $\mathscr{F} = (\mathscr{F}_{ij})_{\mathbf{n} \times \mathbf{n}}$ of $G$ is defined by $\mathscr{F}_{ij} = q^{d_{ij}},$ where $d_{ij}$ denotes the distance between vertices $v_i$ and $v_j$ in $G$. A connected graph is said to be a \emph{bi-block graph} if each of its blocks is a complete bipartite graph, possibly of varying bipartition sizes. In this paper, we obtain explicit expressions for the determinant, inverse, and cofactor sum of the exponential distance matrix of bi-block graphs. As a consequence, some known results concerning the exponential distance matrix and the $q$-Laplacian matrix are generalized.

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

↑