Spectral conditions of complement for some graphical properties

MaRDI QIDQ5243990zbMATH OpenFDO

Authors Guidong Yu, Yi Fang, Yi Xu, Gui-Sheng Jiang

Publication date 19 November 2019

Full work available at URL https://arxiv.org/abs/1712.01503

zbMATH Keywords

complementminimum degreespectral radiusstability

Mathematics Subject Classification ID

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

Abstract: L.H. Feng at el cite{feng4} present sufficient conditions based on spectral radius for a graph with large minimum degree to be $s$-path-coverable and $s$-Hamiltonian. Motivated by this study, in this paper, we give the sufficient conditions for a graph with large minimum degree to be $s$-connected, $s$-edge-connected, $$-deficient, $s$-path-coverable, $s$-Hamiltonian and $s$-edge-Hamiltonian in terms of spectral radius of its complement.

Recommendations

• The number of edges, spectral radius and Hamilton-connectedness of graphs
• Connectivity and spectral radius of graphs.
• Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs
• Sufficient conditions for Hamilton-connected graphs in terms of (signless Laplacian) spectral radius
• Spectral radius and Hamiltonicity of graphs

Cited in

(4)

• Unified spectral Hamiltonian results of balanced bipartite graphs and complementary graphs
• Spectral conditions for graphs to be \(\beta\)-deficient involving minimum degree
• New Complementary Sets With Low PAPR Property Under Spectral Null Constraints
• Connectivity and spectral radius of graphs.

This page was built for publication: Spectral conditions of complement for some graphical properties

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