Saadet Kandİlcİ

Saadet Kandİlcİ

Auto-generated profile, based on publicly available information

Saadet Kandİlcİ

Department of Mathematics, Yasar University, 35100 Izmir

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 July 2013 in Journal of Applied Mathematics
Verified
Journal Article
Open access
PDF file
SKSaadet Kandİlcİ
Saadet Kandİlcİ
GTGoksen Bacak Turan
Goksen Bacak Turan
RPRefet Polat
Refet Polat
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.