Neighbor Rupture Degree of Gear Graphs
Neighbor Rupture Degree of Gear Graphs
Various structures such as communication networks, internet networks, transportation networks, etc. can be demonstrated with the aid of graphs. The common feature of these networks is the presence of one or more centers and the connection between them partially or completely. These networks can be modelled with the help of a graph showing the centers by vertices and the connections by edges. In case of a problem encountered with the centers or the connections of a network, the resistance of the network is called vulnerability. There are some graph parameters to measure the vulnerability such as connectivity, integrity, toughness, tenacity, rupture degree and neighbor rupture degree. Some of these parameters only consider vertices, some of them take into account the neighbors of the vertices. Neighbor rupture degree is a vulnerability parameter that considers the neighborhoods. In this study, the general solutions for the neighbor rupture degree of gear graphs Gn, Gn, Gn,k, Gn,kare obtained
___
- [1] Bondy, J.A.; Murty, U.S.R. Graph Theory With Applications. American Elsevier Publishing Co., Inc., New York, 1976.
- [2] Barefoot, C.A.; Entringer, R.; Swart, H. Vulnerability in Graphs—A Comparative Survey. Journal of Combinatorial Mathematics and Combinatorial Computing. 1987; 1, 13– 22.
- [3] Chvatal, V. Tough Graphs And Hamiltonian Circuits. Discrete Mathematics. 1973; 5, 215–228.
- [4] Jung, H.A. On A Class Of Posets And The Corresponding Comparability Graphs. Journal of Combinatorial Theory Series B. 1978; 24(2), 125–133.
- [5] Cozzens, M.; Moazzami, D.; Stueckle, S. The Tenacity Of A Graph. In Graph Theory, Combinatorics, And Algorithms. Wiley, New York, 1992; 1-2, 1111–1122.
- [6] Li, Y.; Zhang, S.; Li, X. Rupture Degree Of Graphs, International Journal of Computer Mathematics. 2005; 82(7), 793–803.
- [7] Bacak-Turan, G.; Kirlangic, A. Neighbor Rupture Degree and The Relations Between Other Parameters. Ars Combinatoria. 2011; 102, 333-352.
- [8] Gunther, G. Neighbor Connectivity in Regular Graphs. Discrete Applied Mathematics. 1985; 11, 233-243.
- [9] Cozzens, M.B.; Wu, S.S.Y. Vertex-Neighbor İntegrity of Trees. Ars Combinatoria. 1996; 43, 169-180.
- [10] Wei, Z.T. On The Reliability Parameters of Networks. MS Thesis, Northwestern Polytechnical University. 2003; 30-40.
- [11] Aslan, E.; Kirlangic, A. Computing The Scattering Number and The Toughness for Gear Graphs, Bulletin of Society of Mathematicians Banja Luka. 2011; 18, 5-15.
- [12] Brandstadt, A.; Le, V. B.; Spinrad, J. P. Graph Classes: A Survey. SIAM. Philadelphia, PA,1999.
- [13] Rahim, M.T.; Farooq, M.; Ali, M.; Jan, S. Multi-Level Distance Labelings For Generalized Gear Graphs. International Journal of Mathematics and Soft Computing. 2012; 2 (1), 57-63
- ISSN: 1305-130X
- Başlangıç: 2005
- Yayıncı: Manisa Celal Bayar Üniversitesi Fen Bilimleri Enstitüsü