상세검색
최근 검색어 전체 삭제
다국어입력
즐겨찾기0
국가지식-학술정보

Complete characterization of odd factors via the size, spectral radius or distance spectral radius of graphs

Complete characterization of odd factors via the size, spectral radius or distance spectral radius of graphs

  • 0
커버이미지 없음

Given a graph $G,$ a $\{1,3,\ldots,2n-1\}$-factor of $G$ is a spanning subgraph of $G$, in which each degree of vertices is one of $\{1,3,\ldots,2n-1\}$, where $n$ is a positive integer. In this paper, we first establish a lower bound on the size (resp.~the spectral radius) of $G$ to guarantee that $G$ contains a $\{1,3,\ldots,2n-1\}$-factor. Then we determine an upper bound on the distance spectral radius of $G$ to ensure that $G$ has a $\{1,3,\ldots,2n-1\}$-factor. Furthermore, we construct some extremal graphs to show all the bounds obtained in this contribution are best possible.

Given a graph $G,$ a $\{1,3,\ldots,2n-1\}$-factor of $G$ is a spanning subgraph of $G$, in which each degree of vertices is one of $\{1,3,\ldots,2n-1\}$, where $n$ is a positive integer. In this paper, we first establish a lower bound on the size (resp.~the spectral radius) of $G$ to guarantee that $G$ contains a $\{1,3,\ldots,2n-1\}$-factor. Then we determine an upper bound on the distance spectral radius of $G$ to ensure that $G$ has a $\{1,3,\ldots,2n-1\}$-factor. Furthermore, we construct some extremal graphs to show all the bounds obtained in this contribution are best possible.

(0)

(0)

로딩중