Distance spectral radii of k-uniform bicyclic hypergraphs. Issue 21 (20th December 2022)

• Record Type: Journal Article
• Authors: Liu, Xiangxiang; Wang, Ligong
• Is Part Of: Linear & multilinear algebra. Volume 70:Issue 21(2022)
• Page Start: 6190
• Page End: 6210
• Publication Date: 2022-12-20
• Subjects: Distance spectral radius -- Wiener index -- k-uniform bicyclic hypergraph; 05C50 -- 05C65; Algebras, Linear -- Periodicals; Multilinear algebra -- Periodicals; 512.505
• DOI: 10.1080/03081087.2021.1948495
• Languages: English
• ISSNs: 0308-1087

Abstract

Abstract : Let G be a connected hypergraph. The distance spectral radius of G is the largest eigenvalue of its distance matrix. The Wiener index of G is defined to be the sum of distances between every unordered pair of vertices of G . A connected k -uniform hypergraph G with n vertices and m edges is called bicyclic if n = m ( k − 1) − 1. Firstly, we obtain a lower bound on the Wiener index of k -uniform bicyclic hypergraphs with n vertices. As an application, among all k -uniform bicyclic hypergraphs with n vertices, we determine the first four bicyclic hypergraphs with smallest distance spectral radii for k ≥ 4, and the bicyclic hypergraph with minimum distance spectral radius for k = 3.