On distance spectral radius of uniform hypergraphs with cycles

DOI10.1016/j.dam.2017.12.011zbMath1382.05050OpenAlexW2784281849MaRDI QIDQ1706123

Bo Zhou, Hongying Lin

Publication date: 21 March 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.12.011

zbMATH Keywords

cycleuniform hypergraphdistance spectral radiusgraft transformationunicyclic hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (7)

Distance spectral radii of k-uniform bicyclic hypergraphs ⋮ Unnamed Item ⋮ Minimizing the distance spectral radius of uniform hypertrees with given parameters ⋮ The cut method on hypergraphs for the Wiener index ⋮ Distance spectral radii of k-uniform hypertrees with given parameters ⋮ On the eccentric connectivity index of uniform hypergraphs ⋮ Distance (signless) Laplacian eigenvalues of \(k\)-uniform hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Some graft transformations and its application on a distance spectrum
• Distance spectral radius of uniform hypergraphs
• \(q\)-analogs of distance matrices of 3-hypertrees
• On the distance matrix of a tree
• Distance matrix polynomials of trees
• Distance spectra of graphs: a survey
• On the distance spectral radius of trees
• On the Addressing Problem for Loop Switching
• Application of hypergraph theory in chemistry

This page was built for publication: On distance spectral radius of uniform hypergraphs with cycles