Distance spectral radii of k-uniform hypertrees with fixed diameter

IF 0.6 3区数学 Q3 MATHEMATICS Journal of Algebraic Combinatorics Pub Date : 2024-04-06 DOI:10.1007/s10801-024-01316-z

引用次数: 0

Abstract

The distance spectral radius of a connected hypergraph is the largest eigenvalue of its distance matrix. In this paper, we determine the k-uniform hypertree with the minimal spectral radius among all k-uniform hypertrees with m edges and diameter d, where $3\le d\le m-1$ .

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

具有固定直径的 k 个均匀肥大树的距离谱半径

摘要连通超图的距离谱半径是其距离矩阵的最大特征值。在本文中，我们确定了在所有具有 m 条边和直径 d 的 k 个均匀超图中具有最小谱半径的 k 个均匀超图，其中 $3\le d\le m-1$ .

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Journal of Algebraic Combinatorics 数学-数学

CiteScore

1.50

自引率

12.50%

发文量

审稿时长

6-12 weeks

期刊介绍： The Journal of Algebraic Combinatorics provides a single forum for papers on algebraic combinatorics which, at present, are distributed throughout a number of journals. Within the last decade or so, algebraic combinatorics has evolved into a mature, established and identifiable area of mathematics. Research contributions in the field are increasingly seen to have substantial links with other areas of mathematics. The journal publishes papers in which combinatorics and algebra interact in a significant and interesting fashion. This interaction might occur through the study of combinatorial structures using algebraic methods, or the application of combinatorial methods to algebraic problems.

期刊最新文献

On the intersection spectrum of $${\text {PSL}}_2(q)$$ Finite 4-geodesic-transitive graphs with bounded girth Level and pseudo-Gorenstein path polyominoes A second homotopy group for digital images Bipartite determinantal ideals and concurrent vertex maps