A comparison between edge neighbor rupture degree and edge scattering number in graphs

ÖK Kürkçü, E Aslan - … Journal of Foundations of Computer Science, 2018 - World Scientific
The vulnerability measure of a graph or a network depends on robustness of the remained
graph, after being exposed to any intervention or attack. In this paper, we consider two edge …

Neighbor rupture degree of some middle graphs

G Bacak-turan, MÜ Şenoğlu… - … Demirel Üniversitesi Fen …, 2018 - dergipark.org.tr
Networks have an important place in our daily lives. Internet networks, electricity networks,
water networks, transportation networks, social networks and biological networks are some …

[PDF][PDF] A NOTE ON CONNECTED INTEGRITY IN GRAPHS

KS DEVI, M BHUVANESHWARI, S AVADAYAPPAN - 2022 - mililink.com
G- In this paper, we initiate the study of a new parameter of measuring the vulnerability
named Connected Integrity. The Connected Integrity of a graph () EVG, denoted by (), GCI is …

The average binding number of graphs and its algorithm

E Aslan, AK Özdemir - arXiv preprint arXiv:2102.08043, 2021 - arxiv.org
As a result of the interaction of rapid development and competition in information
technologies, the reliability of a network and how solid it remains is important. It is called the …

[PDF][PDF] A NOTE OF NEIGHBOR-TOUGHNESS OF GRAPHS

Z Wei, Y Li - imvibl.org
A NOTE OF NEIGHBOR-TOUGHNESS OF GRAPHS Page 1 BULLETIN OF THE
INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) …

Tekerlek ve Benzer Grafların Komşu Dayanıklılık Değerleri

E Aslan - Karaelmas Fen ve Mühendislik Dergisi, 2017 - dergipark.org.tr
Bir iletişim, bilgisayar, taşıma ağda, bazı merkezlerin veya bağlantı hatlarının bozulmasıyla
iletişim kesilene kadar ağın gösterdiği dayanma gücünün ölçümüne ağın zedelenebilirlik …