Toughness and distance spectral radius in graphs involving minimum degree

DOI10.1016/J.DAM.2024.09.019MaRDI QIDQ6657220

Rui-fang Liu, Jing Lou, Jinlong Shu

Publication date: 6 January 2025

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

zbMATH Keywords

minimum degreetoughnessdistance spectral radius

Mathematics Subject Classification ID

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

Cites Work

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

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)