[PDF][PDF] A measure of graphs vulnerability: Edge scattering number
E Aslan - Bull. Soc. Math. Banja Luka, 2014 - elib.mi.sanu.ac.rs
In a communication network, several vulnerability measures are used to determine the
resistance of the network to disruption of operation after the failure of certain stations or …
resistance of the network to disruption of operation after the failure of certain stations or …
[PDF][PDF] The rupture degree and gear graphs
A Kirlangic - Bulletin of the Malaysian Mathematical Sciences …, 2009 - emis.dsd.sztaki.hu
In a communication network, several vulnerability measures are used to determine the
resistance of the network to disruption of operation after the failure of certain stations or …
resistance of the network to disruption of operation after the failure of certain stations or …
[PDF][PDF] Computing the scattering number and the toughness for gear graphs
E Aslan, A Kirlangic - Bulletin of International Mathematical Virtual …, 2011 - elib.mi.sanu.ac.rs
In a communication network, the vulnerability measures the resistance of the network to
disruption of operation after the failure of certain stations or communication links. To …
disruption of operation after the failure of certain stations or communication links. To …
[HTML][HTML] Graham's pebbling conjecture on product of thorn graphs of complete graphs
Z Wang, Y Zou, H Liu, Z Wang - Discrete Mathematics, 2009 - Elsevier
The pebbling number of a graph G, f (G), is the least n such that, no matter how n pebbles
are placed on the vertices of G, we can move a pebble to any vertex by a sequence of …
are placed on the vertices of G, we can move a pebble to any vertex by a sequence of …
Total rainbow connection numbers of some special graphs
Y Ma, K Nie, F Jin, C Wang - Applied Mathematics and Computation, 2019 - Elsevier
In 2008, Chartrand et al. first introduced the concept of rainbow connection. Since then the
study of rainbow connection has received considerable attention in the literature, and now it …
study of rainbow connection has received considerable attention in the literature, and now it …
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 …
graph, after being exposed to any intervention or attack. In this paper, we consider two edge …
[PDF][PDF] Neighbor toughness of graphs
ÖK Kürkçü, H Aksan - Bull. Int. Math. Virtual Inst, 2016 - imvibl.org
The vulnerability shows the resistance of the network until communication breakdown after
the disruption of certain stations or communication links. This study introduces a new …
the disruption of certain stations or communication links. This study introduces a new …
A note on the partition dimension of thorn of fan graph
A Mardhaningsih - Jurnal Matematika MANTIK, 2019 - jurnalsaintek.uinsa.ac.id
Let be a connected graph and. For a vertex and an ordered k-partition of, the presentation of
concerning is the k-vector, where denotes the distance between and for. The k-partition is …
concerning is the k-vector, where denotes the distance between and for. The k-partition is …
The average scattering number of graphs
The scattering number of a graph is a measure of the vulnerability of a graph. In this paper
we investigate a refinement that involves the average of a local version of the parameter. If v …
we investigate a refinement that involves the average of a local version of the parameter. If v …
Some Results for the rupture Degree.
A Aytac, H Aksu - International Journal of Foundations of …, 2013 - search.ebscohost.com
The rupture degree of an incomplete connected graph G is defined by where w (G− S)
denotes the number of components in the graph G− S and m (G− S) is the order of the …
denotes the number of components in the graph G− S and m (G− S) is the order of the …