Sizhong Zhou - A note of generalization of fractional ID-factor-critical graphs

fi:9975 - Fundamenta Informaticae, October 21, 2022, Volume 187, Issue 1
A note of generalization of fractional ID-factor-critical graphs

Authors: Sizhong Zhou

    In communication networks, the binding numbers of graphs (or networks) are often used to measure the vulnerability and robustness of graphs (or networks). Furthermore, the fractional factors of graphs and the fractional ID-$[a,b]$-factor-critical covered graphs have a great deal of important applications in the data transmission networks. In this paper, we investigate the relationship between the binding numbers of graphs and the fractional ID-$[a,b]$-factor-critical covered graphs, and derive a binding number condition for a graph to be fractional ID-$[a,b]$-factor-critical covered, which is an extension of Zhou's previous result [S. Zhou, Binding numbers for fractional ID-$k$-factor-critical graphs, Acta Mathematica Sinica, English Series 30(1)(2014)181--186].


    Volume: Volume 187, Issue 1
    Published on: October 21, 2022
    Accepted on: August 30, 2022
    Submitted on: August 30, 2022
    Keywords: Mathematics - Combinatorics,05C70

    Share

    Consultation statistics

    This page has been seen 7 times.
    This article's PDF has been downloaded 8 times.