Neighbor isolated tenacity of graphs

Creative Commons License

ASLAN E.

RAIRO - Theoretical Informatics and Applications, cilt.2013, ss.269-284, 2016 (Scopus) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 2013
  • Basım Tarihi: 2016
  • Doi Numarası: 10.1051/ita/2016001
  • Dergi Adı: RAIRO - Theoretical Informatics and Applications
  • Derginin Tarandığı İndeksler: Scopus
  • Sayfa Sayıları: ss.269-284
  • Anahtar Kelimeler: Connectivity, Graph theory, Isolated scattering number, Rupture degree, Tenacity
  • Manisa Celal Bayar Üniversitesi Adresli: Evet

Özet

The tenacity of a graph is a measure of the vulnerability of a graph. In this paper we investigate a refinement that involves the neighbor isolated version of this parameter. The neighbor isolated tenacity of a noncomplete connected graph G is defined to be {x+c(G/X)/i(G/X), i(G/X) ≥1} where the minimum is taken over all X, the cut strategy of G, i(G/X)is the number of components which are isolated vertices of G/X and c(G/X) is the maximum order of the components of G/X. Next, the relations between neighbor isolated tenacity and other parameters are determined and the neighbor isolated tenacity of some special graphs are obtained. Moreover, some results about the neighbor isolated tenacity of graphs obtained by graph operations are given.