An odd [1, b]-factor in a graph from signless Laplacian spectral radius

Open Access

Issue		RAIRO-Oper. Res. Volume 59, Number 1, January-February 2025


Page(s)		33 - 41
DOI		https://doi.org/10.1051/ro/2024223
Published online		06 January 2025

A. Amahashi, On factors with all degrees odd. Graphs Comb. 1 (1985) 111–114. [CrossRef] [Google Scholar]
K. Ando, Y. Egawa, A. Kaneko, K. Kawarabayashi and H. Matsuda, Path factors in claw-free graphs. Discrete Math. 243 (2002) 195–200. [Google Scholar]
A. Brouwer and W. Haemers, Eigenvalues and perfect matchings. Linear Algebra App. 395 (2005) 155–162. [CrossRef] [Google Scholar]
S. Cioabˇa, D. Gregory and W. Haemers, Matchings in regular graphs from eigenvalue. J. Comb. Theory Ser. B 99 (2009) 287–297. [CrossRef] [Google Scholar]
Y. Cui and M. Kano, Some results on odd factors of graphs. J. Graph Theory 12 (1988) 327–333. [CrossRef] [MathSciNet] [Google Scholar]
D. Cvetković and S. Simić, Towards a spectral theory of graphs based on the signless Laplacian I. Publ. Inst. Math. 99 (2009) 19–33. [CrossRef] [Google Scholar]
G. Dai, Toughness and isolated toughness conditions for path-factor critical covered graphs. RAIRO-Oper. Res. 57 (2023) 847–856. [CrossRef] [EDP Sciences] [MathSciNet] [Google Scholar]
D. Fan, H. Lin and H. Lu, Spectral radius and [a, b]-factors in graphs. Discrete Math. 345 (2022) 112892. [CrossRef] [Google Scholar]
W. Gao, Y. Chen and Y. Wang, Network vulnerability parameter and results on two surfaces. Int. J. Intell. Syst. 36 (2021) 4392–4414. [CrossRef] [Google Scholar]
S. Kim, O. Suil, J. Park and H. Ree, An odd [1, b]-factor in regular graphs from eigenvalues. Discrete Math. 343 (2020) 111906. [CrossRef] [MathSciNet] [Google Scholar]
M. Kouider and Z. Lonc, Stability number and [a, b]-factors in graphs. J. Graph Theory 46 (2004) 254–264. [CrossRef] [MathSciNet] [Google Scholar]
R. Kuzel, K. Ozeki and K. Yoshimoto, 2-factors and independent sets on claw-free graphs. Discrete Math. 312 (2012) 202–206. [CrossRef] [MathSciNet] [Google Scholar]
H. Liu and X. Pan, Independence number and minimum degree for path-factor critical uniform graphs. Discrete Appl. Math. 359 (2024) 153–158. [CrossRef] [MathSciNet] [Google Scholar]
C. Liu, Y. Pan and J. Li, Signless Laplacian spectral radius and matchings in graphs. Preprint arXiv: 2007.04479v2 (2020). [Google Scholar]
H. Lu, Z. Wu and X. Yang, Eigenvalues and [1, n]-odd factors. Linear Algebra App. 433 (2010) 750–757. [CrossRef] [Google Scholar]
X. Lv, A degree condition for graphs being fractional (a, b, k)-critical covered. Filomat 37 (2023) 3315–3320. [MathSciNet] [Google Scholar]
O. Suil, Spectral radius and matchings in graphs. Linear Algebra App. 614 (2021) 316–324. [CrossRef] [Google Scholar]
Y. Shen, L. You, M. Zhang and S. Li, On a conjecture for the signless Laplacian spectral radius of cacti with given matching number. Linear Multilinear Algebra 65 (2017) 457–474. [CrossRef] [MathSciNet] [Google Scholar]
S. Wang and W. Zhang, Independence number, minimum degree and path-factors in graphs. Proc. Rom. Acad. Ser. A Math. Phys. Tech. Sci. Inf. Sci. 23 (2022) 229–234. [MathSciNet] [Google Scholar]
S. Wang and W. Zhang, Some results on star-factor deleted graphs. Filomat 38 (2024) 1101–1107. [MathSciNet] [Google Scholar]
J. Wu, Path-factor critical covered graphs and path-factor uniform graphs. RAIRO-Oper. Res. 56 (2022) 4317–4325. [CrossRef] [EDP Sciences] [MathSciNet] [Google Scholar]
J. Wu, A sufficient condition for the existence of fractional (g, f, n)-critical covered graphs. Filomat 38 (2024) 2177–2183. [MathSciNet] [Google Scholar]
L. You, M. Yang, W. So and W. Xi, On the spectrum of an equitable quotient matrix and its application. Linear Algebra App. 577 (2019) 21–40. [CrossRef] [MathSciNet] [Google Scholar]
Y. Zhang and H. Lin, Perfect matching and distance spectral radius in graphs and bipartite graphs. Discrete Appl. Math. 304 (2021) 315–322. [CrossRef] [MathSciNet] [Google Scholar]
S. Zhou, A neighborhood union condition for fractional (a, b, k)-critical covered graphs. Discrete Appl. Math. 323 (2022) 343–348. [CrossRef] [MathSciNet] [Google Scholar]
S. Zhou, Degree conditions and path factors with inclusion or exclusion properties. Bull. Math. Soc. Sci. Math. Roumanie 66 (2023) 3–14. [Google Scholar]
S. Zhou, Path factors and neighborhoods of independent sets in graphs. Acta Math. Appl. Sin. Engl. Ser. 39 (2023) 232–238. [CrossRef] [MathSciNet] [Google Scholar]
S. Zhou, Some results on path-factor critical avoidable graphs. Discuss. Math. Graph Theory 43 (2023) 233–244. [Google Scholar]
S. Zhou, Remarks on restricted fractional (g, f)-factors in graphs. Discrete Appl. Math. 354 (2024) 271–278. [CrossRef] [MathSciNet] [Google Scholar]
S. Zhou and J. Wu, Spanning k-trees and distance spectral radius in graphs. J. Supercomput. 80 (2024) 23357–23366. [CrossRef] [Google Scholar]
S. Zhou, J. Wu and Q. Bian, On path-factor critical deleted (or covered) graphs. Aequationes Math. 96 (2022) 795–802. [CrossRef] [MathSciNet] [Google Scholar]
S. Zhou, Q. Pan and L. Xu, Isolated toughness for fractional (2, b, k)-critical covered graphs. Proc. Rom. Acad. Ser. A Math. Phys. Tech. Sci. Inf. Sci. 24 (2023) 11–18. [CrossRef] [MathSciNet] [Google Scholar]
S. Zhou, Z. Sun and Q. Bian, Isolated toughness and path-factor uniform graphs (II). Indian J. Pure Appl. Math. 54 (2023) 689–696. [CrossRef] [MathSciNet] [Google Scholar]
S. Zhou, Z. Sun and H. Liu, Some sufficient conditions for path-factor uniform graphs. Aequationes Math. 97 (2023) 489–500. [CrossRef] [MathSciNet] [Google Scholar]
S. Zhou, Z. Sun and H. Liu, D-index and Q-index for spanning trees with leaf degree at most k in graphs. Discrete Math. 347 (2024) 113927. [CrossRef] [Google Scholar]
S. Zhou, Z. Sun and H. Liu, Distance signless Laplacian spectral radius for the existence of path-factors in graphs. Aequationes Math. 98 (2024) 727–737. [CrossRef] [MathSciNet] [Google Scholar]
S. Zhou, Y. Zhang and Z. Sun, The A_α-spectral radius for path-factors in graphs. Discrete Math. 347 (2024) 113940. [CrossRef] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.