| dc.contributor.author | Kürkçü, Ö.K. and Aslan, E. | |
| dc.date.accessioned | 2020-07-02T07:10:02Z | |
| dc.date.available | 2020-07-02T07:10:02Z | |
| dc.date.issued | 2018 | |
| dc.identifier.citation | cited By 1 | |
| dc.identifier.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85057051571&doi=10.1142%2fS0129054118500247&partnerID=40&md5=07da86b38802663ec2f85c37bf5c68ed | |
| dc.identifier.uri | http://hdl.handle.net/20.500.12481/12000 | |
| dc.description.abstract | 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 vulnerability parameters that are the edge neighbor rupture degree and the edge scattering number. The values of these parameters of some specific graphs and their graph operations are calculated. Thus, we analyze and compare which parameter is distinctive for the different type of graphs by using tables. © 2018 World Scientific Publishing Company. | |
| dc.language.iso | English | |
| dc.publisher | World Scientific Publishing Co. Pte Ltd | |
| dc.title | A comparison between edge neighbor rupture degree and edge scattering number in graphs | |
| dc.type | Article | |
| dc.contributor.department | Department of Mathematics, Manisa Celal Bayar University, Manisa, 45140, Turkey; Turgutlu Vocational Training School, Manisa Celal Bayar University, Manisa, 45400, Turkey | |
| dc.identifier.DOI-ID | 10.1142/S0129054118500247 | |
| dc.identifier.volume | 29 | |
| dc.identifier.pages | 1119-1142 | |
