#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2000

2018

- This year (0)
- Last 5 years (2)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Goksen Bacak-Turan, Alpay Kirlangic
- Ars Comb.
- 2011

- Alpay Kirlangic, Aysun Ozan Aytaç
- Int. J. Comput. Math.
- 2004

The scattering number of a non-complete connected graph G is defined by sc(G) = max{w(G − S) − |S| : S ⊂ V(G) and w(G − S) ≥ 2}, where w(G − S) denotes the number of components of the graph G − S. If… (More)

- Alpay Kirlangic
- 2002

The scattering number of a graph G, denoted sc(G), is defined by sc(G)=max{c(G−S)−|S|:S⫅V(G) and c(G−S)≠1} where c(G−S) denotes the
number of components in G−S. It is one measure of graph … (More)

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 communication links.… (More)

- Alpay Kirlangic
- J. Math. Model. Algorithms
- 2003

Connectivity has been used in the past to describe the stability of graphs. If two graphs have the same connectivity, then it does not distinguish between these graphs. That is, the connectivity is… (More)

- Alpay Kirlangic
- 2003

In this paper the concept of weak-integrity is introduced as a new measure of the stability of a graph G and it is defined as Iw(G) = min S⊂V (G) {|S| +me(G− S)}, where me(G− S) denotes the number of… (More)

- Alpay Kirlangic, Aysun Ozan Aytaç
- Int. J. Comput. Math.
- 2000

Let Gbe a graph. A vertex subversion strategy of G, say S, is a set of vertices in G whose closed neighbourhood is removed from G. The survival-subgraph is denoted by G/S. The neighbour-integrity of… (More)

The isoperimetric number of a graph , denoted by , was introduced by Mohar (1987). A graph and a subset of its vertices are given, and let denote the edge boundary of , the set of edges which… (More)

- Gülnaz Boruzanli Ekinci, Alpay Kirlangic
- RAIRO - Operations Research
- 2018

Let $ G_1 $ and $ G_2 $ be two graphs. The Kronecker product $ G_1 \times G_2 $ has vertex set $ V(G_1 \times G_2)=V(G_1)\times V(G_2) $ and edge set $ E(G_1 \times G_2) = \{(u_1,v_1)(u_2, v_2) :… (More)

- Goksen Bacak-Turan, Alpay Kirlangic
- Int. J. Found. Comput. Sci.
- 2013

In a communication network, the vulnerability measures are essential to guide the designer in choosing an appropriate topology. They measure the stability of the network to disruption of operation… (More)