THE AVERAGE SCATTERING NUMBER OF GRAPHS

被引：2

作者：

Aslan, Ersin ^{[1
]}

Kilinc, Deniz ^{[2
]}

Yucalar, Fatih ^{[2
]}

Borandag, Emin ^{[2
]}

机构：

[1] Celal Bayar Univ, Turgutlu Vocat Training Sch, TR-45400 Manisa, Turkey

[2] Celal Bayar Univ, Dept Software Engn, TR-45400 Manisa, Turkey

来源：

RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS | 2016年 / 50卷 / 03期

关键词：

Connectivity; rupture degree; scattering number; average lower domination number; average lower independence number;

D O I：

10.1051/ita/2016027

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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 is a vertex in a connected graph G, then sc(v)(G) = max{omega(G - S-v) - vertical bar S-v vertical bar},where the maximum is taken over all disconnecting sets S-v of G that contain v. The average scattering number of G denoted by sc(av)(G), is defined as sc(av)(G) = Sigma v is an element of V(G)sc(v)(G)/n, where n will denote the number of vertices in graph G. Like the scattering number itself, this is a measure of the vulnerability of a graph, but it is more sensitive. Next, the relations between average scattering number and other parameters are determined. The average scattering number of some graph classes are obtained. Moreover, some results about the average scattering number of graphs obtained by graph operations are given.

引用

页码：263 / 272

页数：10

共 11 条

[1] The Average Lower Connectivity of Graphs
Aslan, Ersin
[J]. JOURNAL OF APPLIED MATHEMATICS, 2014,
[2] Chvatal V., 1973, Discrete Mathematics, V5, P215, DOI 10.1016/0012-365X(73)90138-6
[3] ANALYSIS AND DESIGN OF SURVIVABLE NETWORKS
FRANK, H
FRISCH, IT
[J]. IEEE TRANSACTIONS ON COMMUNICATION TECHNOLOGY, 1970, CO18 (05): : 501 - &
[4] Scattering number and modular decomposition
Giakoumakis, V
Roussel, F
Thuillier, H
[J]. DISCRETE MATHEMATICS, 1997, 165 : 321 - 342
[5] Harary F., 1994, GRAPH THEORY
[6] The average connectivity of a digraph
Henning, MA
Oellermann, OR
[J]. DISCRETE APPLIED MATHEMATICS, 2004, 140 (1-3) : 143 - 153
[7] CLASS OF POSETS AND CORRESPONDING COMPARABILITY GRAPHS
JUNG, HA
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1978, 24 (02) : 125 - 133
[8] Ouyang K., 1993, J. Lanzhou Univ. Nat. Sci., V29, P43
[9] Relationships between scattering number and other vulnerability parameters
Zhang, SG
Peng, SY
[J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2004, 81 (03) : 291 - 298
[10] Zhang SG, 2001, NETWORKS, V37, P102, DOI 10.1002/1097-0037(200103)37:2<102::AID-NET5>3.0.CO

← 1 2 →