Spectral conditions of complement for some graphical properties

Guidong Yu; Yi Fang; Yi Xu

Spectral conditions of complement for some graphical properties

Combinatorics 2017-12-06 v1

Authors: Guidong Yu , Yi Fang , Yi Xu

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, $\beta$ -deficient, $s$ -path-coverable, $s$ -Hamiltonian and $s$ -edge-Hamiltonian in terms of spectral radius of its complement.

Keywords

spectral graph theory graph theory

Cite

@article{arxiv.1712.01503,
  title  = {Spectral conditions of complement for some graphical properties},
  author = {Guidong Yu and Yi Fang and Yi Xu},
  journal= {arXiv preprint arXiv:1712.01503},
  year   = {2017}
}

Related papers

View all related →