Graph Operations and Neighbor Rupture Degree
In a communication network, the vulnerability parameters measure the resistance of the network to disruption of operation after the failure of certain stations or communication links. A vertex subversion strategy of a graph , say , is a set of vertices in whose closed neighborhood is removed from ....
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2013-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2013/836395 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849404944322396160 |
|---|---|
| author | Saadet Kandİlcİ Goksen Bacak-Turan Refet Polat |
| author_facet | Saadet Kandİlcİ Goksen Bacak-Turan Refet Polat |
| author_sort | Saadet Kandİlcİ |
| collection | DOAJ |
| description | In a communication network, the vulnerability parameters measure the resistance of the network to disruption of operation after the failure of certain stations or communication links. A vertex subversion strategy of a graph , say , is a set of vertices in whose closed neighborhood is removed from . The survival subgraph is denoted by . The neighbor rupture degree of , , is defined to be , where is any vertex subversion strategy of , is the number of connected components in and is the maximum order of the components of (G. Bacak Turan, 2010). In this paper we give some results for the neighbor rupture degree of the graphs obtained by some graph operations. |
| format | Article |
| id | doaj-art-99b4e582abe34729a6c0dcbee7d6c0d8 |
| institution | Kabale University |
| issn | 1110-757X 1687-0042 |
| language | English |
| publishDate | 2013-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Applied Mathematics |
| spelling | doaj-art-99b4e582abe34729a6c0dcbee7d6c0d82025-08-20T03:36:48ZengWileyJournal of Applied Mathematics1110-757X1687-00422013-01-01201310.1155/2013/836395836395Graph Operations and Neighbor Rupture DegreeSaadet Kandİlcİ0Goksen Bacak-Turan1Refet Polat2Department of Mathematics, Yasar University, 35100 Izmir, TurkeyDepartment of Mathematics, Celal Bayar University, 45140 Manisa, TurkeyDepartment of Mathematics, Yasar University, 35100 Izmir, TurkeyIn a communication network, the vulnerability parameters measure the resistance of the network to disruption of operation after the failure of certain stations or communication links. A vertex subversion strategy of a graph , say , is a set of vertices in whose closed neighborhood is removed from . The survival subgraph is denoted by . The neighbor rupture degree of , , is defined to be , where is any vertex subversion strategy of , is the number of connected components in and is the maximum order of the components of (G. Bacak Turan, 2010). In this paper we give some results for the neighbor rupture degree of the graphs obtained by some graph operations.http://dx.doi.org/10.1155/2013/836395 |
| spellingShingle | Saadet Kandİlcİ Goksen Bacak-Turan Refet Polat Graph Operations and Neighbor Rupture Degree Journal of Applied Mathematics |
| title | Graph Operations and Neighbor Rupture Degree |
| title_full | Graph Operations and Neighbor Rupture Degree |
| title_fullStr | Graph Operations and Neighbor Rupture Degree |
| title_full_unstemmed | Graph Operations and Neighbor Rupture Degree |
| title_short | Graph Operations and Neighbor Rupture Degree |
| title_sort | graph operations and neighbor rupture degree |
| url | http://dx.doi.org/10.1155/2013/836395 |
| work_keys_str_mv | AT saadetkandilci graphoperationsandneighborrupturedegree AT goksenbacakturan graphoperationsandneighborrupturedegree AT refetpolat graphoperationsandneighborrupturedegree |