Complete characterization of odd factors via the size, spectral radius or distance spectral radius of graphs
1
조회
0
다운로드
0
인용
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.
Abstract
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.
참고문헌 (16)
- A. Amahashi, "On factors with all degrees odd", Graphs Combin, 1(2), pp.111~114 (1985)[DOI]
- R. B. Bapat, "Graphs and Matrices" (2014), Springer
- J. A. Bondy, "Graph Theory with Applications" (1976), American Elsevier Publishing Co., Inc
- $-factor in a graph, "대한수학회보", 2021, 31~46, pp.대한수학회, 10.4134[DOI]
- C. Godsil, "Algebraic Graph Theory, Graduate Texts in Mathematics" (2001), Springer-Verlag
- R. A. Horn, "Matrix Analysis" (1985), Cambridge University Press
- S. Li, "Characterizing P>2-factor and P>2-factor covered graphs with respect to the size or the spectral radius", Discrete Math, 344(11), pp.12~ (2021)[DOI]
- Z. Liu, "On spectral radius of the distance matrix", Appl. Anal. Discrete Math, 4(2), pp.269~277 (2010)[DOI]
- H. Minc, "Nonnegative Matrices, Wiley-Interscience Series in Discrete Mathematics and Optimization" (1988), John Wiley & Sons, Inc
- V. Nikiforov, "Merging the A-and Q-spectral theories", Appl. Anal. Discrete Math, 11(1), pp.81~107 (2017)[DOI]
- S. O, "Spectral radius and matchings in graphs", Linear Algebra Appl, 614, pp.316~324 (2021)[DOI]
- W. T. Tutte, "The factorization of linear graphs", J. London Math. Soc, 22, pp.107~111 (1947)[DOI]
- M. L. Vergnas, "An extension of Tutte’s 1-factor theorem", Discrete Math, 23(3), pp.241~255 (1978)[DOI]
- D. B. West, "Introduction to Graph Theory" (1996), Prentice Hall, Inc
- L. You, "On the spectrum of an equitable quotient matrix and its application", Linear Algebra Appl, 577, pp.21~40 (2019)[DOI]
- C. Yuting, "Some results on odd factors of graphs", J. Graph Theory, 12(3), pp.327~333 (1988)[DOI]