Neighbor Rupture Degree of Some Middle Graphs
Öz
Networks have an important place in our daily lives. Internet networks, electricity networks, water networks, transportation networks, social networks and biological networks are some of the networks we run into every aspects of our lives. A network consists of centers connected by links. A network is represented when centers and connections modelled by vertices and edges, respectively. In consequence of the failure of some centers or connection lines, measurement of the resistance of the network until the communication interrupted is called vulnerability of the network. In this study, neighbor rupture degree which is a parameter that explores the vulnerability values of the resulting graphs due to the failure of some centers of a communication network and its neighboring centers becoming nonfunctional were applied to some middle graphs and neighbor rupture degree of the $M(C_{n}),$ $M(P_{n}),$ $M(K_{1,n}),$ $M(W_{n}),$ $M(P_{n}\times K_{2})$ and $M(C_{n}\times K_{2})$ have been found.
Anahtar Kelimeler
Kaynakça
- [1] Bondy, J.A., Murty, U.S.R. 1976. Graph theory with application. Elsevier Science Ltd/North-Holland. 264s
- [2] Chavatal, V. 1973. Tough graphs and Hamiltonian circuits. Discrete Math, 5(3), 215-228.
- [3] Entringer, R., Swart H. 1987. Vulnerability in Graphs- A Comparative Survey. J. Combin. Math. Combin. Comput, 1, 12-22.
- [4] Cozzens, M., Moazzami, D., Stueckle, S. 1995. The Tenacity of a graph. Graph theory, combinatorics and algorithms, 1, 1-2.
- [5] Jung, H. A. 1978. On a class of posets and the corresponding comparability graphs. J. Combinatorial Theory Series B, 24(2), 125-133.
- [6] Li, Y., Zhang, S., Li, X. 2005. Rupture degree of graphs. International Journal of Computer Mathematics, 82(7), 793-803.
- [7] Bacak-Turan, G., Kirlangic, A. 2011. Neighbor Rupture Degree and The Relations Between Other Parameters. Ars Combinatoria, 102, 333-352.
- [8] Gunther, G. 1985. Neighbor connectivity in regular graphs. Discrete Applied Mathematics, 11(3), 233-243.
Ayrıntılar
Birincil Dil
Türkçe
Konular
-
Bölüm
-
Yayımlanma Tarihi
16 Nisan 2018
Gönderilme Tarihi
21 Ağustos 2017
Kabul Tarihi
-
Yayımlandığı Sayı
Yıl 2018 Cilt: 22 Sayı: 1
APA
Bacak-turan, G., Ülkü Şenoğlu, M., & Altundağ, F. N. (2018). Neighbor Rupture Degree of Some Middle Graphs. Süleyman Demirel Üniversitesi Fen Bilimleri Enstitüsü Dergisi, 22(1), 75-80. https://doi.org/10.19113/sdufbed.09657
AMA
1.Bacak-turan G, Ülkü Şenoğlu M, Altundağ FN. Neighbor Rupture Degree of Some Middle Graphs. Süleyman Demirel Üniv. Fen Bilim. Enst. Derg. 2018;22(1):75-80. doi:10.19113/sdufbed.09657
Chicago
Bacak-turan, Gökşen, Meltem Ülkü Şenoğlu, ve Ferhan Nihan Altundağ. 2018. “Neighbor Rupture Degree of Some Middle Graphs”. Süleyman Demirel Üniversitesi Fen Bilimleri Enstitüsü Dergisi 22 (1): 75-80. https://doi.org/10.19113/sdufbed.09657.
EndNote
Bacak-turan G, Ülkü Şenoğlu M, Altundağ FN (01 Nisan 2018) Neighbor Rupture Degree of Some Middle Graphs. Süleyman Demirel Üniversitesi Fen Bilimleri Enstitüsü Dergisi 22 1 75–80.
IEEE
[1]G. Bacak-turan, M. Ülkü Şenoğlu, ve F. N. Altundağ, “Neighbor Rupture Degree of Some Middle Graphs”, Süleyman Demirel Üniv. Fen Bilim. Enst. Derg., c. 22, sy 1, ss. 75–80, Nis. 2018, doi: 10.19113/sdufbed.09657.
ISNAD
Bacak-turan, Gökşen - Ülkü Şenoğlu, Meltem - Altundağ, Ferhan Nihan. “Neighbor Rupture Degree of Some Middle Graphs”. Süleyman Demirel Üniversitesi Fen Bilimleri Enstitüsü Dergisi 22/1 (01 Nisan 2018): 75-80. https://doi.org/10.19113/sdufbed.09657.
JAMA
1.Bacak-turan G, Ülkü Şenoğlu M, Altundağ FN. Neighbor Rupture Degree of Some Middle Graphs. Süleyman Demirel Üniv. Fen Bilim. Enst. Derg. 2018;22:75–80.
MLA
Bacak-turan, Gökşen, vd. “Neighbor Rupture Degree of Some Middle Graphs”. Süleyman Demirel Üniversitesi Fen Bilimleri Enstitüsü Dergisi, c. 22, sy 1, Nisan 2018, ss. 75-80, doi:10.19113/sdufbed.09657.
Vancouver
1.Gökşen Bacak-turan, Meltem Ülkü Şenoğlu, Ferhan Nihan Altundağ. Neighbor Rupture Degree of Some Middle Graphs. Süleyman Demirel Üniv. Fen Bilim. Enst. Derg. 01 Nisan 2018;22(1):75-80. doi:10.19113/sdufbed.09657