On the weak-integrity of trees
Küçük Resim Yok
Tarih
2003
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
In this paper the concept of weak-integrity is introduced as a new measure of the stability of a graph G and it is defined as $I_w(G)= min_{S \subset V (G)} \{ |S| + m_e(G-S) \}$, where $m_e$(G-S) denotes the number of edges of a largest component of G-S. We investigate the weak-integrity of trees and compute the weak-integrity of a binomial tree and all the trees with at most 7 vertices. We also give some results about the weak-integrity of graphs obtained from binary operations.
In this paper the concept of weak-integrity is introduced as a new measure of the stability of a graph G and it is defined as $I_w(G)= min_{S \subset V (G)} \{ |S| + m_e(G-S) \}$, where $m_e$(G-S) denotes the number of edges of a largest component of G-S. We investigate the weak-integrity of trees and compute the weak-integrity of a binomial tree and all the trees with at most 7 vertices. We also give some results about the weak-integrity of graphs obtained from binary operations.
In this paper the concept of weak-integrity is introduced as a new measure of the stability of a graph G and it is defined as $I_w(G)= min_{S \subset V (G)} \{ |S| + m_e(G-S) \}$, where $m_e$(G-S) denotes the number of edges of a largest component of G-S. We investigate the weak-integrity of trees and compute the weak-integrity of a binomial tree and all the trees with at most 7 vertices. We also give some results about the weak-integrity of graphs obtained from binary operations.
Açıklama
Anahtar Kelimeler
Matematik
Kaynak
Turkish Journal of Mathematics
WoS Q Değeri
Scopus Q Değeri
Cilt
27
Sayı
3
