Combining the concept of a fractional (g, f)-covered graph with that of a fractional ID-(g, f)-factor-critical graph, we define the concept of a fractional ID-(g, f)-factor-critical covered graph. This paper reveals the relationship between some graph parameters and the existence of fractional ID-(g, f)-factor-critical covered graphs. A sufficient condition for a graph being a fractional ID-(g, f)-factor-critical covered graph is presented. In addition, we demonstrate the sharpness of the main result in this paper by constructing a special graph class. Furthermore, the relationship between other graph parameters(such as binding number, toughness, sun toughness and neighborhood union) and fractional ID-(g, f)-factor-critical covered graphs can be studied further.
Keywords: Independence number, minimum degree, fractional ($$, $$)-covered graph, fractional ID-($$, $$)-factor-critical graph, fractional ID-($$, $$)-factor-critical covered graph
@article{RO_2022__56_5_3257_0,
author = {Liu, Hongxia},
title = {Sharp conditions on fractional {ID-}$( g , f )$-factor-critical covered graphs},
journal = {RAIRO. Operations Research},
pages = {3257--3265},
year = {2022},
publisher = {EDP-Sciences},
volume = {56},
number = {5},
doi = {10.1051/ro/2022144},
mrnumber = {4481131},
zbl = {1502.05205},
language = {en},
url = {https://www.numdam.org/articles/10.1051/ro/2022144/}
}
TY - JOUR AU - Liu, Hongxia TI - Sharp conditions on fractional ID-$( g , f )$-factor-critical covered graphs JO - RAIRO. Operations Research PY - 2022 SP - 3257 EP - 3265 VL - 56 IS - 5 PB - EDP-Sciences UR - https://www.numdam.org/articles/10.1051/ro/2022144/ DO - 10.1051/ro/2022144 LA - en ID - RO_2022__56_5_3257_0 ER -
Liu, Hongxia. Sharp conditions on fractional ID-$( g , f )$-factor-critical covered graphs. RAIRO. Operations Research, Tome 56 (2022) no. 5, pp. 3257-3265. doi: 10.1051/ro/2022144
[1] , and , A note on the existence of fractional -factors in random graphs. Acta Math. Appl. Sin. Engl. Ser. 30 (2014) 677–680. | MR | Zbl | DOI
[2] and , Sufficient conditions for graphs to have -factors. Discrete Math. 151 (1996) 87–90. | MR | Zbl | DOI
[3] and , Degree sum condition for fractional ID--factor-critical graphs. Miskolc Math. Notes 18 (2017) 751–758. | MR | Zbl | DOI
[4] , and , A toughness condition for fractional -deleted graphs revisited. Acta Math. Sin. Engl. Ser. 35 (2019) 1227–1237. | MR | Zbl | DOI
[5] , and , The extension degree conditions for fractional factor. Acta Math. Sin. Engl. Ser. 36 (2020) 305–317. | MR | Zbl | DOI
[6] and , -Factors of cubic bipartite graphs. Discrete Math. 344 (2021) 112357. | MR | Zbl | DOI
[7] , , , and , Forbidden pairs of disconnected graphs for -factor of connected graphs. J. Graph Theory 100 (2022) 209–231. | MR | Zbl | DOI
[8] , Fractional -factors in regular graphs. Aust. J. Combin. 73 (2019) 432–439. | MR | Zbl
[9] , and , On fractional -covered graphs. OR Trans. China 6 (2002) 65–68.
[10] , Binding number for path-factor uniform graphs. Proc. Rom. Acad. Ser. A Math. Phys. Tech. Sci. Inf. Sci. 23 (2022) 25–32. | MR | Zbl
[11] and , Toughness and the existence of fractional -factors of graphs. Discrete Math. 308 (2008) 1741–1748. | MR | Zbl | DOI
[12] , Fan-type results for the existence of -factors. Discrete Math. 306 (2006) 688–693. | MR | Zbl | DOI
[13] and , -factors in regular graphs. Acta Math. Sin-English Ser. 24 (2008) 1213–1220. | MR | Zbl | DOI
[14] and , Research on fractional critical covered graphs. Probl. Inf. Transm. 56 (2020) 270–277. | Zbl | DOI
[15] and , On -orthogonal factorizations in networks. RAIRO-Oper. Res. 55 (2021) 969–977. | MR | Zbl | Numdam | DOI
[16] and , Isolated toughness for path factors in networks. RAIRO-Oper. Res. 56 (2022) 2613–2619. | MR | Zbl | Numdam | DOI
[17] , A neighborhood union condition for fractional -critical covered graphs. Discrete Appl. Math. (2021) DOI: . | DOI | MR | Zbl
[18] , A result on fractional -critical covered graphs. Acta Math. Appl. Sin. Engl. Ser. 37 (2021) 657–664. | MR | Zbl | DOI
[19] , Binding numbers and restricted fractional -factors in graphs. Discrete Appl. Math. 305 (2021) 350–356. | MR | Zbl | DOI
[20] , Path factors and neighborhoods of independent sets in graphs. Acta Math. Appl. Sin. Engl. Ser. (2022) DOI: . | DOI | MR | Zbl
[21] , Remarks on restricted fractional -factors in graphs. Discrete Appl. Math. (2022) DOI: . | DOI | MR | Zbl
[22] and , The existence of path-factor uniform graphs with large connectivity. RAIRO-Oper. Res. 56 (2022) 2919–2927. | MR | Zbl | Numdam | DOI
[23] , and , Toughness, isolated toughness and path factors in graphs. Bull. Aust. Math. Soc. 106 (2022) 195–202. | MR | Zbl | DOI
[24] and , Discussions on orthogonal factorizations in digraphs. Acta Math. Appl. Sin. Engl. Ser. 38 (2022) 417–425. | MR | Zbl | DOI
[25] , and , Path factors in subgraphs. Discrete Appl. Math. 319 (2022) 183–191. | MR | Zbl | DOI
[26] , and , A note on fractional ID--factor-critical covered graphs. Discrete Appl. Math. 319 (2022) 511–516. | MR | Zbl | DOI
[27] , and , Isolated toughness and path-factor uniform graphs (II). Indian J. Pure Appl. Math. (2022) DOI: . | DOI | MR | Zbl
[28] , and , On path-factor critical deleted (or covered) graphs. Aequationes Math. 96 (2022) 795–802. | MR | Zbl | DOI
[29] , and , Independence number and connectivity for fractional -critical covered graphs. RAIRO-Oper. Res. 56 (2022) 2535–2542. | MR | Zbl | Numdam | DOI
Cité par Sources :
