Toughness and distance spectral radius in graphs involving minimum degree

DOI10.1016/J.DAM.2024.09.019MaRDI QIDQ6657220zbMATH OpenFDO

Authors Jing Lou, Rui-fang Liu, Jinlong Shu

Publication date 6 January 2025

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

zbMATH Keywords

minimum degreedistance spectral radiustoughness

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Recommendations

• Toughness and spectral radius in graphs
• Toughness, Hamiltonicity and spectral radius in graphs
• Toughness and normalized Laplacian eigenvalues of graphs
• Various results on the toughness of graphs
• Minimal toughness in special graph classes

Cites work

• scientific article; zbMATH DE number 428989 (Why is no real title available?)
• Algebraic conditions for t-tough graphs
• Characterizing star factors via the size, the spectral radius or the distance spectral radius of graphs
• Chromatic number and the 2-rank of a graph
• Complete characterization of odd factors via the size, spectral radius or distance spectral radius of graphs
• Distance spectrum, 1-factor and vertex-disjoint cycles
• Graph theory
• Interlacing eigenvalues and graphs
• Matching extension and distance spectral radius
• Matrix Analysis
• ON THE SIZE, SPECTRAL RADIUS, DISTANCE SPECTRAL RADIUS AND FRACTIONAL MATCHINGS IN GRAPHS
• Perfect matching and distance spectral radius in graphs and bipartite graphs
• Tough graphs and Hamiltonian circuits.
• Toughness, Hamiltonicity and spectral radius in graphs
• Various results on the toughness of graphs

Cited in

(6)

• Two variants of toughness of a graph and its eigenvalues
• Toughness and spectral radius in graphs
• Extremal distance spectra of graphs and essential connectivity
• Distance signless Laplacian spectral radius and toughness in graphs with given minimum degree and order
• Eigenvalues and component factors in graphs
• Toughness, Hamiltonicity and spectral radius in graphs

This page was built for publication: Toughness and distance spectral radius in graphs involving minimum degree

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