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

DOI10.3233/FI-222130arXiv1907.08396MaRDI QIDQ6322358FDOQ6322358

Authors: Sizhong Zhou 

Publication date: 19 July 2019

Abstract: 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].

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fractional graph theory, fuzzy graph theory (05C72)

This page was built for publication: A note of generalization of fractional ID-factor-critical graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6322358)