The Neighbour-Integrity of total graphs
Küçük Resim Yok
Tarih
2000
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Gordon Breach Sci Publ Ltd
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
Let G be a graph. A vertex subversion strategy of G, say S, is a set of vertices in G whose closed neighbourhood is removed from G. The survival-subgraph is denoted by G/S. The neighbour-integrity of G, NI(G), is defined to be NI(G) = min(S subset of or equal toV(G)){\S\ + c(G/S)}, where S is any vertex subversion strategy of G, and c(G/S) is the maximum order of the components of G/S. This paper includes results on the neighbour-integrity of total graphs.
Açıklama
Anahtar Kelimeler
vulnerability, connectivity, integrity, Neighbour-Integrity
Kaynak
International Journal of Computer Mathematics
WoS Q Değeri
Q4
Scopus Q Değeri
Cilt
76
Sayı
1
