Skip to main content
SpringerLink
Log in

A Short Note on Spanning Cactus Problem of Petersen Graph

  • Conference paper
  • First Online:
Intelligent Techniques and Applications in Science and Technology (ICIMSAT 2019)

Part of the book series: Learning and Analytics in Intelligent Systems ((LAIS,volume 12))

Abstract

We study the spanning cactus problem on Petersen graph. Whether there exist a spanning cactus or not in a general graph is an intractable problem. The computational complexity of the algorithm for finding the minimum spanning cactus in a general graph is also NP- complete. In this paper we present a result which states that there does not exist any spanning cactus when the graph under consideration is a Petersen graph.

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

Access this chapter

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

References

  1. West, D.B.: Introduction to Graph Theory, PHI Learning Pvt. Ltd.

    Google Scholar 

  2. Harary, Graph Theory, Narosa Publishing House

    Google Scholar 

  3. Datta, A.K., Debnath, C.: Spanning cactus: complexity and extensions. Discret. Appl. Math. 233, 19–28 (2017)

    Article  MathSciNet  Google Scholar 

  4. Datta, A.K.: Approximate spanning cactus. Inf. Process. Lett. 115(11), 828–832 (2015)

    Article  MathSciNet  Google Scholar 

  5. Debnath, C., Datta, A.K.: Spanning Cactus and spanning cactus extension on outerplanar graphs, Manuscripts

    Google Scholar 

  6. Debnath, C., Datta, A.K.: Minimum Spanning Cactus Problem on Halin graphs, Manuscripts

    Google Scholar 

  7. Deo, Graph Theory, Prentice Hall of India

    Google Scholar 

  8. Kruskal, J.B.: On the shortest spanning subtree of a graph and the travelling salesman problem. Proc. Am. Math. Soc. 7, 48–50 (1956)

    Article  Google Scholar 

  9. Palbom, A.: Complexity of the directed spanning cactus problem. Discret. Appl. Math. 146, 81–91 (2005)

    Article  MathSciNet  Google Scholar 

  10. Dinits, E.A., Karzanov, A.V., Lomonosov, M.V.: On the structure of a family of minimal weighted cuts in graphs. In: Fridman, A.A. (ed.) Studies in Discrete Mathematics, Nauka, Moskva, pp. 290–306 (1976). (in Russian)

    Google Scholar 

  11. Aho, Hopcroft, Ullman: The Design and Analysis of Computer Algorithms, Pearson Education

    Google Scholar 

  12. Gutin, G., Punnen, A.P.: The Travelling Salesman Problem and its Variations. Kluwer, Dordrecht (2002)

    MATH  Google Scholar 

  13. Lawler, E.: Combinatorial Optimization: Networks and Matroids, Holt, Rinehert and Winston, New York (1976)

    Google Scholar 

  14. Das, K., Pal, M.: An optimal algorithm to find maximum and minimum height spanning trees on cactus graphs. Adv. Model. Optim. 10(1), 121–134 (2008)

    MathSciNet  MATH  Google Scholar 

  15. Maheshwari, A., Zeh, N.: External memory algorithms for outerplanar graphs. In: Proceedings of the 10th International Symposium on Algorithms and Computation. LNCS, vol. 1741, pp. 307–316. Springer, Heidelberg (1999)

    Google Scholar 

  16. Fleischer, L.: Building chain and cactus representations of all minimum cuts from Hao-Orlin in the same asymptotic run time. J. Algorithms 33, 51–72 (1999)

    Article  MathSciNet  Google Scholar 

  17. Kabadi, S.N., Punnen, A.P.: Spanning cactus of a graph: existence, extension, optimization, and approximation. Discret. Appl. Math. 161, 167–175 (2013)

    Article  MathSciNet  Google Scholar 

  18. Ben-Moshe, B., Bhattacharya, B., Shi, Q., Tamir, A.: Efficient algorithms for center problems in cactus networks. Theor. Comput. Sci. 378, 237–252 (2007)

    Article  MathSciNet  Google Scholar 

  19. Paten, B., Diekhans, M., Earl, D., John, J.S.T., Ma, J., Suh, B., Haussler, D.: Cactus graphs for genome comparisons. J. Comput. Biol. 18, 469–481 (2011)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and System Sciences, Visva-Bharati University, Santiniketan, 731235, India

    Chinmay Debnath & Alak Kumar Datta

Authors
  1. Chinmay Debnath
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alak Kumar Datta
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chinmay Debnath .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering, Siliguri Institute of Technology, Sukna, West Bengal, India

    Subhojit Dawn

  2. Department of Automation and Applied Informatics, Aurel Vlaicu University of Arad, Arad, Arad, Romania

    Valentina Emilia Balas

  3. Department of Psychology and IIASS, Università della Campania “Luigi Vanvitelli”, Caserta, Caserta, Italy

    Anna Esposito

  4. Mizoram University, Aizawl, Mizoram, India

    Sadhan Gope

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

Debnath, C., Datta, A.K. (2020). A Short Note on Spanning Cactus Problem of Petersen Graph. In: Dawn, S., Balas, V., Esposito, A., Gope, S. (eds) Intelligent Techniques and Applications in Science and Technology. ICIMSAT 2019. Learning and Analytics in Intelligent Systems, vol 12. Springer, Cham. https://doi.org/10.1007/978-3-030-42363-6_88

Download citation

Publish with us

Policies and ethics

Search

Navigation