Skip to main content
SpringerLink
Log in
Book cover

International Conference on Machine Learning for Cyber Security

ML4CS 2020: Machine Learning for Cyber Security pp 20–30Cite as

Network Adjacency Condition for Fractional \((g,f,n',m)\)-Critical Covered Graphs

  • Conference paper
  • First Online:

  • 1119 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 12487))

Abstract

In resource scheduling network, the availability of resource scheduling can be converted into the existing the fractional factor of the related network graph. The study of the existence of fractional factors in specific graph structure is helpful for engineers design and the building of the network that possesses effective resources. If after any \(n'\) vertices from G removed, the remaining graph is still a fractional (g, f, m)-covered graph, a graph G is a fractional \((g,f,n',m)\)-critical covered graph. The paper presents a network adjacency condition for a graph to be fractional \((g,f,n',m)\)-critical covered.

Supported by Modern Education Technology Research Project in Jiangsu Province (No. 2019-R-75637) and horizontal foundation “Design of equipment access system based on 3D printing cloud service platform” in Yunnan Normal University (No. 2019530101000686).

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   99.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   129.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Bondy, J.A., Mutry, U.S.R.: Graph Theory. Springer, Berlin (2008)

    Google Scholar 

  2. Gao, W., Wang, W.: New isolated toughness condition for fractional \((g, f, n)\)-critical graphs. Colloquium Mathematicum 147, 55–66 (2017)

    Article  MathSciNet  Google Scholar 

  3. Gao, W., Wang, W.: A tight neighborhood union condition on fractional \((g, f, n, m)\)-critical deleted graphs. Colloquium Mathematicum 147, 291–298 (2017)

    Article  MathSciNet  Google Scholar 

  4. Gao, W., Wang, W.: Toughness and fractional critical deleted graph. Utilitas Math. 98, 295–310 (2015)

    MathSciNet  MATH  Google Scholar 

  5. Gao, W., Guirao, J.L.G., Wu, H.: Two tight independent set conditions for fractional \((g, f, m)\)-deleted graphs systems. Qual. Theory Dyn. Syst. 17, 231–243 (2018)

    Article  MathSciNet  Google Scholar 

  6. Gao, W., Liang, L., Xu, T., Zhou, J.: Degree conditions for fractional \((g, f, n^{\prime }, m)\)-critical deleted graphs and fractional ID-\((g, f, m)\)-deleted graphs. Bull. Malays. Math. Sci. Soc. 39, 315–330 (2016)

    Article  MathSciNet  Google Scholar 

  7. Gao, W., Liang, L., Xu, T., Zhou, J.: Tight toughness condition for fractional \((g, f, n)\)-critical graphs. J. Korean Math. Soc. 51, 55–65 (2014)

    Article  MathSciNet  Google Scholar 

  8. Gao, W., Wang, W.: On fractional \((g, f, n^{\prime }, m)\)-critical covered graphs. Manuscript

    Google Scholar 

  9. Gao, W., Zhang, Y., Chen, Y.: Neighborhood condition for all fractional \((g, f, n^{\prime }, m)\)-critical deleted graphs. Open Phys. 16, 544–553 (2018)

    Article  Google Scholar 

Download references

Acknowledgments

We thank the reviewers for their constructive comments in improving the quality of this paper.

Author information

Authors and Affiliations

  1. School of Computer Engineering, Jiangsu University of Technology, Changzhou, 213001, China

    Yu Pan

  2. Department of Mathematics and Science Education, Faculty of Education, Harran University, Sanliurfa, Turkey

    Haci Mehmet Baskonus & Wei Gao

Authors
  1. Yu Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Haci Mehmet Baskonus
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wei Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yu Pan .

Editor information

Editors and Affiliations

  1. Xidian University, Xi'an, China

    Xiaofeng Chen

  2. Guangzhou University, Guangzhou, China

    Hongyang Yan

  3. Michigan State University, East Lansing, MI, USA

    Qiben Yan

  4. Division of Computer, Electrical and Mathematical Sciences and Engineering, King Abdullah University of Science, Thuwal, Saudi Arabia

    Xiangliang Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Pan, Y., Baskonus, H.M., Gao, W. (2020). Network Adjacency Condition for Fractional \((g,f,n',m)\)-Critical Covered Graphs. In: Chen, X., Yan, H., Yan, Q., Zhang, X. (eds) Machine Learning for Cyber Security. ML4CS 2020. Lecture Notes in Computer Science(), vol 12487. Springer, Cham. https://doi.org/10.1007/978-3-030-62460-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-62460-6_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-62459-0

  • Online ISBN: 978-3-030-62460-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation