On distance spectral radius of uniform hypergraphs with cycles

DOI10.1016/J.DAM.2017.12.011MaRDI QIDQ1706123zbMATH OpenOpenAlexFDO

Authors Hongying Lin, Bo Zhou

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

cycledistance spectral radiusgraft transformationunicyclic hypergraphuniform hypergraph

Mathematics Subject Classification ID

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

Recommendations

• On distance spectral radius of hypergraphs
• Distance (signless) Laplacian spectral radius of uniform hypergraphs
• Distance spectral radii of k-uniform hypertrees with given parameters

Cites work

• \(q\)-analogs of distance matrices of 3-hypertrees
• Application of hypergraph theory in chemistry
• Distance matrix polynomials of trees
• Distance spectra of graphs: a survey
• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 193132 (Why is no real title available?)
• On the Addressing Problem for Loop Switching
• On the distance matrix of a tree
• On the distance spectral radius of trees
• Some graft transformations and its application on a distance spectrum

Cited in

(14)

• On least distance eigenvalue of uniform hypergraphs
• On the eccentric connectivity index of uniform hypergraphs
• Distance (signless) Laplacian eigenvalues of \(k\)-uniform hypergraphs
• The effect on the spectral radius of r-graphs by grafting or contracting edges
• Extremal properties of the distance spectral radius of hypergraphs
• Distance spectral radii of k-uniform hypertrees with given parameters
• Distance spectral radii of k-uniform bicyclic hypergraphs
• 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 fixed diameter
• The -spectral radii of k-uniform hypertrees
• Computation of M-polynomial and topological indices of hypergraphs with linkages to brain functions
• The distance spectral radius of k -uniform hypertrees with given number of vertices of maximum degree
• An extended hypergraph cut method for the Wiener index

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1706123)