KaydedilenlerDerginizi ekleyin

Dergiler / Turkish Journal of Mathematics / 2003 / Cilt: 27 - Sayı: 3

On the Weak-Integrity of Trees

Alpay KIRLANGIÇ
Sayfa
375–388
Yayın Tarihi
2003-03-01
DOI
—
🏛️Bu makalenin bibliyografik verileri ve tam metin bağlantısı DergiPark üzerinden sağlanmıştır.
DergiPark Kaydı ↗
✨

Yapay Zeka Hızlı Bakış & Çıkarımlar

AI Insight
⚡ TL;DR(1 Cümlede Hızlı Çıkarım)

We also give some results about the weak-integrity of graphs obtained from binary operations.

📌 3 Maddede Bu Makale

🎯
Amaç & Hipotez:In this paper the concept of {\em weak-integrity} is introduced as a new measure of the stability of a graph \( G \) and it is defined as Iw(G)={\minS\subset V(G)\{|S|+me(G-S)\}}, where me(G-S) denotes the number of edges of a largest component of G-S.
📊
Temel Bulgular & Veri: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.
💡
Sonuç & Katkı:We also give some results about the weak-integrity of graphs obtained from binary operations.
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Stability · Connectivity · Integrity

Özet

In this paper the concept of {\em weak-integrity} is introduced as a new measure of the stability of a graph \( G \) and it is defined as Iw(G)={\minS\subset V(G)\{|S|+me(G-S)\}}, where me(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.

Abstract

In this paper the concept of {\em weak-integrity} is introduced as a new measure of the stability of a graph \( G \) and it is defined as Iw(G)={\minS\subset V(G)\{|S|+me(G-S)\}}, where me(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.

🔖

Bu Makaleye Atıf Yap

KIRLANGIÇ, A. (2003). On the Weak-Integrity of Trees. Turkish Journal of Mathematics, Cilt: 27 - Sayı: 3, 375–388. https://ajindex.com/articles/723427

📄 Tam Metin PDF Okuyucu

📄

PDF görüntüleyici hazırlanıyor...