A Shortest Path Problem for Drug Delivery Using Domination and Eccentricity

  • Conference paper
  • First Online:
Human-Centric Smart Computing

Abstract

The concept of domination was first introduced in by Ore in 1962. With this, the study of domination gained importance and has been vigorously studied since then. The idea about eccentricity for vertices in a graph was given by Buckley and Harary in 1990. This paper combined the ideas about domination and eccentricity and provides the observation obtained during the study. Most of the basic ideas about domination and eccentricity has been covered and also a comparative study between these two has been stated along with problem of drug transportation through networks. These ideas can be further used to solve the real-world problems which uses concepts of domination and eccentricity like for example drug delivery game theory problems, routing problem, assignment problem and many more.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
EUR 29.95
Price includes VAT (Germany)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 213.99
Price includes VAT (Germany)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR 267.49
Price includes VAT (Germany)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info
Hardcover Book
EUR 267.49
Price includes VAT (Germany)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Yang, S.H., Wang, H.L.: A note on the 2-tuple total domination problem in harary graphs. In: 2016 International Computer Symposium (ICS), pp. 68–73 (2016)

    Google Scholar 

  2. Berger, M.O.: Neural channel assignment-the fast way. In: Proceedings of ICNN’95—International Conference on Neural Networks, vol 4, pp. 1557–1560 (1995)

    Google Scholar 

  3. Tamura, H., Sengoku, M., Shinoda, S.: New applications of computational geometry and graph theory to cellular mobile communications. In: Proceedings of APCCAS’96—Asia Pacific Conference on Circuits and Systems, pp. 199–202 (1996)

    Google Scholar 

  4. Sengoku, M., Tamura, H., Shinoda, S., Abe, T.: Graph amp; network theory and cellular mobile communications. In 1993 IEEE International Symposium on Circuits and Systems (ISCAS), vol.4, pp. 2208–2211 (1993)

    Google Scholar 

  5. M. Sengoku, H., Tamura, K., Mase, S., Shinodu, A.: Routing problem on ad-hoc networks and graph theory. In WCC 2000—ICCT 2000. 2000 International Conference on Communication Technology Proceedings (Cat. No.00EX420), vol 2, pp. 1710–1713 (2000)

    Google Scholar 

  6. Åžahin, B.: new network entropy: the domination entropy of graphs. Inf. Proces. Lett. 174, 106195 (2022)

    Google Scholar 

  7. Hernandes, F., Lourenco, M.: An algorithm for the minimum spanning tree problem with uncertain structures. IEEE Lat. Am. Trans. 13(12), 3885–3889 (2015)

    Article  Google Scholar 

  8. Zhuang, Y., Liang, Z., Ling-xiang, Z.: Public transportation guidance modeland algorithm. In 2006 International Conference on Communication Technology, pp. 1–4 (2006)

    Google Scholar 

  9. Cabrera-Martínez, A., Rodríguez-Velázquez, J.A.: A note on double domination in graphs. Discrete Appl. Math. 300, 107–111 (2021)

    Google Scholar 

  10. Wang, J., Lu, M., Belardo, F. and Randić, M.: The anti-adjacencymatrix of a graph: eccentricity matrix. Discrete Appl. Math. 251, 299– 309 (2018)

    Google Scholar 

  11. Angel, D., Arputhamary, I.A. and Ezhilarasi, K.: Location domination forgeneralized friendship graphs analytics. In 2021 5th International Conference on Computing Methodologies and Communication (ICCMC), pp. 865–868 (2021)

    Google Scholar 

  12. Bergstresser, K., Charnes, A., Yu, P.L.: Generalization of domination structures and nondominated solutions in multi criteria decision making. J. Optim. Theory Appl. 18(1), 3–13 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  13. Alizadeh, Y., Došlić, T. and Xu, K.: On the eccentric complexity of graphs. Bull. Malaysian Math. Sci. Soc. 42(4), 1607–1623 (2019)

    Google Scholar 

  14. Masre, M., Vetrík, T.: On the general degree-eccentricity index of a graph. Afrika Matematika 32(3), 495–506 (2021)

    Google Scholar 

  15. Zhang, Z., Jigang, W. and Duan, X.: Practical algorithm for shortest path on transportation network. In: 2010 International Conference on Computer and Information Application, pp. 48–51 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Debabrata Samanta .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kartha, J.R., Dahal, R., Samanta, D., Poonia, R.C., Bhattacharya, A., Dutta, S. (2023). A Shortest Path Problem for Drug Delivery Using Domination and Eccentricity. In: Bhattacharyya, S., Banerjee, J.S., Köppen, M. (eds) Human-Centric Smart Computing. Smart Innovation, Systems and Technologies, vol 316. Springer, Singapore. https://doi.org/10.1007/978-981-19-5403-0_17

Download citation

Publish with us

Policies and ethics

Navigation