Solving Edges Deletion Problem of Generalized Petersen Graphs

Authors

  • Anwar Nasif Jasim Department of Mathematics, Faculty of CS and Mathematics University of Kufa, Iraq https://orcid.org/0000-0002-1095-062X
  • Alaa A. Najim College of Science University of Basrah

DOI:

https://doi.org/10.31642/JoKMC/2018/110102%20

Keywords:

Edges deletion problem, Graph theory, Generalized Petersen graph, Altered graph, Diameter

Abstract

The dependability and effectiveness of a network can be investigated using a variety of graph-theoretic techniques, and the network's connectivity determines how reliable it is. Diameter in a network is often used to measure the efficiency of a network in the event that a network experiences issues such as a decline in the communication signal or a breakdown in the communication between its components. This paper examines the increase in diameter of the generalized Petersen graph  after removing a certain number of edges. Finding the exact values of f(n,t) that represent the maximum diameter of an altered generalized Petersen graph GP(n,k,t) obtained after removing  edges from  for k=1 and t≥2.

Downloads

Download data is not yet available.

References

B. Mahavir, “ Optimal book embedding of the generalized petersen graph p (n, 2) ”. International Conference on Mathematical Computer Engineering-ICMCE, pp 921-926, 2013.

S.A. Abdul-Ghani, R.D. Abdul-Wahhab and E.W. Abood , “Securing Text Messages Using Graph Theory and Steganography“. Baghdad Sci. J., Vol. 19, No. 1 , pp189-196,2022. http://dx.doi.org/10.21123/bsj.2022.19.1.0189 .

M.S. Krishnamoorthy and B. Krishnamurthy, “Fault diameter of interconnection networks”. , Computers & Mathematics with Applications, Elsevier, Vol. 13, pp 577—582 ,1987.

A. S Mary and P. Sivagamia, “On 3-rainbow Domination in Petersen graphs P (n, 2) and P (n, 3)”. International Conference on Mathematical Computer Engineering-ICMCE, pp 779-783 , 2013.

G. Chartrand, H. Hevia and R.J. Wilson , “The ubiquitous Petersen graph”. The Julius Petersen Graph Theory Centennial, North Holland, Vol.6, pp303—311, 1992.

I. Rajasingh, M. Arockiaraj , B. Rajan and P. Manuel, “Circular wirelength of generalized Petersen graphs“. Journal of Interconnection Networks, World Scientific, Vol. 12 , No. 4 , pp319-335, 2011,

https://doi.org/10.1142/S0219265911003027.

Downloads

Published

2024-03-30

How to Cite

Nasif Jasim, A., & Najim, A. A. (2024). Solving Edges Deletion Problem of Generalized Petersen Graphs. Journal of Kufa for Mathematics and Computer, 11(1), 6–10. https://doi.org/10.31642/JoKMC/2018/110102

Similar Articles

1 2 3 4 5 6 > >> 

You may also start an advanced similarity search for this article.