Analysis of fractional factor system for data transmission in SDN

[1]R. P. Anstee. (1990), Simplified existence theorems for g, f )-factors, Discrete Appl. Math., 27, 29–38. Anstee R. P. 1990 Simplified existence theorems for g, f )-factors Discrete Appl. Math 27 29–38Search in Google Scholar

[2]S. Gong, M. K. Siddiquib, Y. Luo, and W. Gao. (2017), Feasibility analysis of data transmission in SDN, J. Intell. Fuzzy Syst., 33, 3145–3152. Gong S. Siddiquib M. K. Luo Y. Gao W. 2017 Feasibility analysis of data transmission in SDN, J Intell. Fuzzy Syst 33 3145–3152Search in Google Scholar

[3]M. Knor, R. Škrekovski and A. Tepeh. (2018), Convexity result and trees with large Balaban index, Appl. Math. Nonl. Sc., 3(2), 433–446. Knor M. Škrekovski R. Tepeh A. 2019 Convexity result and trees with large Balaban index Appl. Math. Nonl. Sc 32 433 446Search in Google Scholar

[4]D. L. Liu, C. X. Wang, and S. H. Wang. (2018), Hamilton-connectivity of interconnection networks modeled by a product of graphs, Appl. Math. Nonl. Sc., 3(2), 419–426. Liu D. L. Wang C. X. Wang S. H. 2019 Hamilton-connectivity of interconnection networks modeled by a product of graphs Appl. Math. Nonl. Sc 32 419 426Search in Google Scholar

[5]A. R. Virk and M. Quraish. (2018), Some invariants of flower graph, Appl. Math. Nonl. Sc., 3(2), 427–432. Virk A. R. Quraish M. 2019 Some invariants of flower graph Appl. Math. Nonl. Sc 32 427 432Search in Google Scholar