Access the full text.
Sign up today, get DeepDyve free for 14 days.
S. Wang, W. Zhang (2020)
Research on Fractional Critical Covered GraphsProblems of Information Transmission, 56
Sizhong Zhou (2014)
Remarks on orthogonal factorizations of digraphsInternational Journal of Computer Mathematics, 91
Sizhong Zhou, Jiang Xu, Lan Xu (2021)
Component factors and binding number conditions in graphsAIMS Mathematics
Sizhong Zhou, Qiuxiang Bian, Q. Pan (2021)
Path factors in subgraphsDiscret. Appl. Math., 319
Sizhong Zhou, Zhiren Sun, Hui Ye (2013)
A toughness condition for fractional (k, m)-deleted graphsInf. Process. Lett., 113
Sizhong Zhou, Yang Xu, Zhiren Sun (2019)
Degree conditions for fractional (a, b, k)-critical covered graphsInf. Process. Lett., 152
C Berge (1978)
165Proc. K. Ned. Acad. Wet. Amsterdam (A), 81
Sizhong Zhou, Zhiren Sun, Q. Pan (2020)
A Sufficient Condition for the Existence of Restricted Fractional (g, f)-Factors in GraphsProblems of Information Transmission, 56
M. Kano (1990)
A sufficient condition for a graph to have [a, b]-factorsGraphs and Combinatorics, 6
Yuan Yuan, Rongxia Hao (2019)
A degree condition for fractional [a, b]-covered graphsInf. Process. Lett., 143
Sizhong Zhou (2021)
A neighborhood union condition for fractional (a, b, k)-critical covered graphsDiscret. Appl. Math., 323
Zhiren Sun, Sizhong Zhou (2018)
A generalization of orthogonal factorizations in digraphsInf. Process. Lett., 132
Sizhong Zhou, Qiuxiang Bian, Zhiren Sun (2021)
Two Sufficient Conditions for Component Factors in GraphsDiscussiones Mathematicae Graph Theory, 0
Sizhong Zhou, Zhiren Sun, Zurun Xu (2017)
A result on r-orthogonal factorizations in digraphsEur. J. Comb., 65
Wei Gao, Weifan Wang (2017)
New isolated toughness condition for fractional $(g,f,n)$-critical graphsColloquium Mathematicum, 147
Su Wang, Wei Zhang (2021)
On k-orthogonal factorizations in networksRAIRO Oper. Res., 55
Sizhong Zhou (2022)
Some Results on Path-Factor Critical Avoidable GraphsDiscussiones Mathematicae Graph Theory, 43
Wei Gao, J. Guirao, Hualong Wu (2017)
Two Tight Independent Set Conditions for Fractional (g, f, m)-Deleted Graphs SystemsQualitative Theory of Dynamical Systems, 17
J. Aledo, S. Sanahuja, J. Valverde (2015)
Parallel Dynamical Systems over Graphs and Related Topics: A SurveyJ. Appl. Math., 2015
C. Berge, M. Vergnas (1978)
On the existence of subgraphs with degree constraints, 81
Liming Xiong (2017)
Characterization of forbidden subgraphs for the existence of even factors in a graphDiscret. Appl. Math., 223
Z Li (2002)
65OR Transactions (China), 6
M. Axenovich, Jonathan Rollin (2014)
Brooks type results for conflict-free colorings and {a, b}-factors in graphsDiscret. Math., 338
Sizhong Zhou, Bingyuan Pu, Yang Xu (2010)
NEIGHBOURHOOD AND THE EXISTENCE OF FRACTIONAL k-FACTORS OF GRAPHSBulletin of the Australian Mathematical Society, 81
Atsushi Amahashi, M. Kano (1982)
On factors with given componentsDiscret. Math., 42
Sizhong Zhou, Hongxia Liu, Yang Xu (2021)
A note on fractional ID-[a, b]-factor-critical covered graphsDiscret. Appl. Math., 319
Sizhong Zhou, Zhiren Sun, Hongxia Liu (2021)
Isolated toughness and path-factor uniform graphsRAIRO Oper. Res., 55
Sizhong Zhou (2019)
Remarks on path factors in graphsRAIRO Oper. Res., 54
Wei Gao, Weifan Wang (2017)
A TIGHT NEIGHBORHOOD UNION CONDITION ON FRACTIONAL (g, f, n', m)-CRITICAL DELETED GRAPHSColloquium Mathematicum, 149
G. Liu, Qinglin Yu, Lanju Zhang (2007)
Maximum fractional factors in graphsAppl. Math. Lett., 20
S. Chiba, T. Yamashita (2017)
A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphsDiscret. Math., 340
Sizhong Zhou (2020)
Binding numbers and restricted fractional (g, f)-factors in graphsDiscret. Appl. Math., 305
THE FRACTIONAL g
Sizhong Zhou, Zhiren Sun (2020)
Binding number conditions for P≥2-factor and P≥3-factor uniform graphsDiscret. Math., 343
Sizhong Zhou, Tao Zhang, Zurun Xu (2020)
Subgraphs with orthogonal factorizations in graphsDiscret. Appl. Math., 286
Wei Gao, J. Guirao, Yaojun Chen (2019)
A Toughness Condition for Fractional (k, m)-deleted Graphs RevisitedActa Mathematica Sinica, English Series, 35
Z. Iangsun (2002)
On Fractional (g, f)-Covered Graphs
Sizhong Zhou (2019)
Some results about component factors in graphsRAIRO Oper. Res., 53
Sizhong Zhou (2011)
Some new sufficient conditions for graphs to have fractional k-factorsInternational Journal of Computer Mathematics, 88
Aung Kyaw (2001)
A Sufficient Condition for a Graph to Have a k-treeGraphs and Combinatorics, 17
Yuan Yuan, Rongxia Hao (2018)
A Neighborhood Union Condition for Fractional ID-[a, b]-factor-critical GraphsActa Mathematicae Applicatae Sinica, English Series, 34
Sizhong Zhou, Fan Yang, Lan Xu (2018)
Two sufficient conditions for the existence of path factors in graphsScientia Iranica
A fractional [a, b]-factor of a graph G is a function h from E(G) to [0, 1] satisfying a≤dGh(v)≤b\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$a \le d_G^h(v) \le b$$\end{document} for every vertex v of G, where dGh(v)=∑e∈E(v)h(e)\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$d_G^h(v) = \sum\limits_{e \in E(v)} {h(e)} $$\end{document} and E(v) = {e = uv : u ∈ V (G)}. A graph G is called fractional [a, b]-covered if G contains a fractional [a, b]-factor h with h(e) = 1 for any edge e of G. A graph G is called fractional (a, b, k)-critical covered if G — Q is fractional [a, b]-covered for any Q ⊆ V(G) with ∣Q∣ = k. In this article, we demonstrate a neighborhood condition for a graph to be fractional (a, b, k)-critical covered. Furthermore, we claim that the result is sharp.
Acta Mathematicae Applicatae Sinica – Springer Journals
Published: Oct 1, 2021
Keywords: graph; neighborhood; fractional [a, b]-factor; fractional [a, b]-covered graph; fractional (a, b, k)-critical covered graph; 05C70; 05C72
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.