Spectral sufficient conditions of the existence of the longest path in the graph and its traceability

MaRDI QIDQ6153237FDOQ6153237

Authors: V. I. Benediktovich 

Publication date: 13 February 2024

Full work available at URL: https://vestifm.belnauka.by/jour/article/view/641

Recommendations

• Spectral sufficient conditions on traceable graphs
• Sufficient spectral conditions on Hamiltonian and traceable graphs
• Some sufficient spectral conditions on Hamilton-connected and traceable graphs
• scientific article; zbMATH DE number 6831911
• Spectral radius and traceability of graphs with large minimum degree

zbMATH Keywords

spectrummain spectrumspectral radius of graph\(( \kappa, \tau )\)-regular set

Mathematics Subject Classification ID

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

Cites Work

• A sharp upper bound of the spectral radius of graphs
• An introduction to the theory of graph spectra
• Title not available (Why is that?)
• Necessary and sufficient conditions for a Hamiltonian graph
• An overview of \((\kappa, \tau)\)-regular sets and their applications

This page was built for publication: Spectral sufficient conditions of the existence of the longest path in the graph and its traceability

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