Vulnerability Parameter of Book graph

Kavitha B N; Indrani Pramod Kelkar; Rajanna K R

doi:https://doi.org/10.14445/22315373/IJMTT-V66I5P501

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 66 | Issue 5 | Year 2020 | Article Id. IJMTT-V66I5P501 | DOI : https://doi.org/10.14445/22315373/IJMTT-V66I5P501

Vulnerability Parameter of Book graph

Kavitha B N, Indrani Pramod Kelkar, Rajanna K R

Citation :

Kavitha B N, Indrani Pramod Kelkar, Rajanna K R, "Vulnerability Parameter of Book graph," International Journal of Mathematics Trends and Technology (IJMTT), vol. 66, no. 5, pp. 1-5, 2020. Crossref, https://doi.org/10.14445/22315373/IJMTT-V66I5P501

Abstract

Book graph Bm is cross product of star graph Sm+1 and path graph P2. Tenacity of an incomplete connected graph G is defined as T(G) = min { |s|+m(G-s)/ w(G-s) :s ⊂ V(G), w(G-S) > 1}. where w(G-S) is the number of components in G - S. Rupture degree of graph is defined as R(G) = max{ w(G-X) - |X| - m(G-X): X ⊂ V(G) and w (G-X) >1}. Tenacity and Rupture degree are vulnerability majors of graph, which reflects on the difficulty in breaking down the network. In this paper we present results on Tenacity and Rupture degree of Book graph. We also present relation between tenacity and rupture degree with other parameters like integrity, toughness, scattering number of book graph.

Keywords

Book graph, Tenacity, Rupture degree, Vulnerability.

References

[1] Bauer, Douglas, Broersma, Hajo; Schmeichel, Edward(2006), “Toughness in graphs-a survey”, Graph and Combinatotrics, 22(1); 1-35, doi: 10.1007/s00373-006-0649-0, MR 2221006.
[2] C.A. Barefoot, R. Entringer & Henda C. Swart, Vulnerability in graphs A comparative survey, J.Combin. Math Combin. Comput. 1(1987) 13-22.( integrity 3)
[3] Chvatal, Vaclaav(1973), “Tough graph and Hamitonian circuits’, Discrete Mathematics, 5(3); 215-228,doi:10.1016/0012-365X(73)90138-6, MR 0316301.
[4] Fengwei Li. : Some Result on Tenacity of Graphs”, Wseas Transactions on Mathematics, E-ISSN: 2224-2880, ISSUE 9, Volume 11, September 2012.
[5] Gallian, J.A. “Dynamic Survey DS6: Graph Labelling”. “Electronic J. Combinatorics. [1]
[6] G. Chartand and L. Lesnaik, Graphs and Digraphs Chapman and Hall. CRC, 4th edition, 2005.[2]
[7] H.A. Jung. On a class of posets and the cprresponding comparability graphs. J. Combin. Theory, Ser, B, 24(2)(1978),125-133.
[8] Imrich, Wilfired; Klavzar, Sandi; Rall, Douglas F(2008), Graph ans their Cartesian product, A.K Peters, ISBN 1-56881-421-1.[9]
[9] Imrich, Wilfried; Klavzar, Sandi(2000), Product Graphs; Structure and Recognition, Wiley, ISBN 0-471-37039-8. [10]
[10] Kavitha B N, Indrani Kelkar, Split and Equitable domination in book graph and stacked book graph, International Journal of Advanced Research in computer science, Volume 8,No.6, July2017(Special Issue III). ISSN NO.0976-5697.
[11] Kavitha B N and Indrani Pramod Kelkar, Rajanna K R, Perfect domination in Book graph and Stacked book graph, International Journal of Mathematics Trends and Technology (IJMTT) – Volume 56 Issue 7 – April 2018.
[12] M.B. Cozzens, D. Moazzami, S.Stueckle, The tenacity of the Harary graphs, J.Combin. Math.Combin.Comput.16(1994) 33-56. { 3 }
[13] M.B. Cozzens, D. Moazzami, S.Stueckle, The tenacity of a graph, in: Yousef Alavi, Allen Schwenk (Eds.), Graph Theory, Combinatorics, and Algorithms, Wiley, Newyork, 1995, pp.1111-1112.{4}
[14] Tutan Turoci, H. Aksan, “The vulnerability of some Networks including cycle via domination parameters”. Journal of optimization, vol 2016.
[15] Y.K. Li and X.L. Li, Rupture degrees of graphs, Int.J. Comput. Math., Vol.82 2005,(7):pp.793-803.{Refernce1}