Yıl 2018, Cilt 22, Sayı 1, Sayfalar 75 - 80 2017-12-27

Neighbor Rupture Degree of Some Middle Graphs

Gökşen BACAK-TURAN [1] , Meltem ÜLKÜ ŞENOĞLU [2] , Ferhan Nihan ALTUNDAĞ [3]

652 133

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.
Graph theory, Vulnerability; Neighbor rupture degree; Middle graphs
  • [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.
  • [9] Cozzens, M. B., Wu, S.S.Y. 1996. Vertex-neighbor Integrity of trees. Ars Combinatoria, 43, 169-180.
  • [10] Kirlangic, A. 2004. Graph Operations and Neighbor Integrity. Mathematica Bohemica, 129(3), 245-254.
  • [11] Wei, Z.T. 2003. On the reliability parameters of networks. Northwestern Polytechnical University, MSc. Thesis, 40s.
  • [12] Kurkcu, O.K., Aksan, H. 2016. Neighbor Toughness of graphs. Bulletin of International Mathematical Virtual Institue, 6(2), 135-141.
  • [13] Aslan, E. 2015. Neighbor Isolated Tenacity of Graphs. RAIRO-Theor. Inf.Appl. 49(4), 269-284.
  • [14] Nihei, M.2001. On the toughness of the middle graph of a graph. Ars Combinatoria, 49, 55-58.
  • [15] Mamut, A., Vulmar, E.2007. A Note on the Integrity of Middle Graphs. Discrete Geometry, Combinatorics and Graph Theory, Lecture Notes in Computer Science, 4381, 130-134.
  • [16] Odabas, Z., Aytac, A. 2012. Rupture Degree and Middle Graphs. Comptess rendus de I’Acade’mie bulgare des Sciences, 65(3), 315-322.
  • [17] Aytac, A., Turaci, T., Odabas, Z. 2013. On the bondage number of middle graphs. Mathematical Notes, 93(5), 795-801.
  • [18] Aytac, A. 2005. On the edge-tenacity of the middle graph of a graph. International Journal of Computer Mathematics, 82(5), 551-558.
Konular
Dergi Bölümü Makaleler
Yazarlar

Yazar: Gökşen BACAK-TURAN

Yazar: Meltem ÜLKÜ ŞENOĞLU

Yazar: Ferhan Nihan ALTUNDAĞ

Bibtex @ { sdufenbed425672, journal = {Süleyman Demirel Üniversitesi Fen Bilimleri Enstitüsü Dergisi}, issn = {}, eissn = {1308-6529}, address = {Süleyman Demirel Üniversitesi}, year = {2017}, volume = {22}, pages = {75 - 80}, doi = {10.19113/sdufbed.09657}, title = {Neighbor Rupture Degree of Some Middle Graphs}, key = {cite}, author = {ÜLKÜ ŞENOĞLU, Meltem and BACAK-TURAN, Gökşen and ALTUNDAĞ, Ferhan Nihan} }
APA BACAK-TURAN, G , ÜLKÜ ŞENOĞLU, M , ALTUNDAĞ, F . (2017). Neighbor Rupture Degree of Some Middle Graphs. Süleyman Demirel Üniversitesi Fen Bilimleri Enstitüsü Dergisi, 22 (1), 75-80. Retrieved from http://dergipark.gov.tr/sdufenbed/issue/37055/425672
MLA BACAK-TURAN, G , ÜLKÜ ŞENOĞLU, M , ALTUNDAĞ, F . "Neighbor Rupture Degree of Some Middle Graphs". Süleyman Demirel Üniversitesi Fen Bilimleri Enstitüsü Dergisi 22 (2017): 75-80 <http://dergipark.gov.tr/sdufenbed/issue/37055/425672>
Chicago BACAK-TURAN, G , ÜLKÜ ŞENOĞLU, M , ALTUNDAĞ, F . "Neighbor Rupture Degree of Some Middle Graphs". Süleyman Demirel Üniversitesi Fen Bilimleri Enstitüsü Dergisi 22 (2017): 75-80
RIS TY - JOUR T1 - Neighbor Rupture Degree of Some Middle Graphs AU - Gökşen BACAK-TURAN , Meltem ÜLKÜ ŞENOĞLU , Ferhan Nihan ALTUNDAĞ Y1 - 2017 PY - 2017 N1 - DO - T2 - Süleyman Demirel Üniversitesi Fen Bilimleri Enstitüsü Dergisi JF - Journal JO - JOR SP - 75 EP - 80 VL - 22 IS - 1 SN - -1308-6529 M3 - UR - Y2 - 2018 ER -
EndNote %0 Süleyman Demirel Üniversitesi Fen Bilimleri Enstitüsü Dergisi Neighbor Rupture Degree of Some Middle Graphs %A Gökşen BACAK-TURAN , Meltem ÜLKÜ ŞENOĞLU , Ferhan Nihan ALTUNDAĞ %T Neighbor Rupture Degree of Some Middle Graphs %D 2017 %J Süleyman Demirel Üniversitesi Fen Bilimleri Enstitüsü Dergisi %P -1308-6529 %V 22 %N 1 %R %U
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 (Aralık 2017): 75-80.