Tekerlek ve Benzer Grafların Komşu Dayanıklılık Değerleri

Year 2017, Volume: 7 Issue: 1, 320 - 324, 01.01.2017

Ersin Aslan

Abstract

Bir iletişim, bilgisayar, taşıma ağda, bazı merkezlerin veya bağlantı hatlarının bozulmasıyla iletişim kesilene kadar ağın gösterdiği dayanma gücünün ölçümüne ağın zedelenebilirlik değeri denir. Bir G grafı için S, komşu kesim küme ve ω G/S S kümesi ve komşu tepeleri graftan atıldıktan sonra bileşen sayısı olmak üzere; komşu dayanıklılık değerinin tanımı

Keywords

Çizge teori, Komşu dayanıklılık değeri, Dayanıklılık değeri, Zedelenebilirlik

The Neighbor Toughness of Wheels and Related Networks

Abstract

In a network communication, computer, transportation , the vulnerability parameters measure the resistance of the network to disruption of operation after the failure of certain stations or communication links. In this paper, the relations between neighbor toughness and other parameters are determined. Next, the neighbor toughness of wheels and some related networks namely gear, helm, sunflower and friendshipgraph are calculated.

Keywords

Graph Theory, Vulnerability, Toughness, Neighbor Toughness.

References

• Aslan, E., Bacak-Turan,G. 2016. Mean rupture degree of graphs, University Politehnica Of Buch. Sci. Bull. Ser. A-App. Math. and Phy. 78/1: 233–242.
• Bacak-Turan, G.; Kirlangic, A. 2013. Neighbor integrity of transformation graphs, Inter. J. Found.Comp. Sci., 24/3 : 303– 317.
• Bagga, K.S., Beineke, L.W., Goddard, W., Pippert, R.E., Lipman, M.J. 1992. A survey of integrity, Discrete Appl. Math., 76: 13–28.
• Chvatal, V. 1973. Tough graphs and hamiltonian circuits. Discrete Math., 5: 215–228.1 Cozzens, M.B., Wu, S.S.Y. 1996.
• Vertex-neighbor-integrity of trees. Ars Combin., 43:169-180.
• Gallian, J. A. 2007. Dynamic survey graph labeling. Electronic J. Combinatorics, DS6: 1–58
• Gunther, G. 1985. Neighbor connectivity in regular graphs. Discrete Appl. Math., 11:233–243.
• Harary, F. 1994. Graph theory. Reading, MA: Addison-Wesley.. Javaid, I., Shokat, S.2008. On the partition dimension of some wheel related graphs. J. Prm. Rsr. Math., 4: 154–164.
• Jung, H.A. 1978. On a class of posets and the corresponding comparability graphs. J. Combin.Theory, Series B. 24; 125–133.
• Kırlangıç, A., Aytaç, AO. 2004. The scattering number of thorn graphs. Inter. J. Computer Math., 81, 3; 299–311.
• Kurkcu, O.K., Aksan, H. 2016. Neighbor toughness of graphs. Bull. Of The Int.Math. 255 Virt. Inst.:, 6, 135–141
• Turaci, T. 2016. Zagreb Eccentricity Indices of Cycles Related Graphs, Ars Combin., 125; 247–256.
• Turaci, T., Okten, M. 2015. Vulnerability of mycielski graphs via residual closeness, Ars Combin., 118; 419–427.
• Wei, Z.T., Mai, A., Zhai, M. 2011. Vertex-neighbor-scattering number of graphs. Ars Combin.,102: 417–426.