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
来源
关键词
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
相关论文
共 50 条
  • [41] List r-hued chromatic number of graphs with bounded maximum average degrees
    Song, Huimin
    Lai, Hong-Jian
    Wu, Jianliang
    DISCRETE MATHEMATICS, 2018, 341 (05) : 1244 - 1252
  • [42] Graphs with average labellings
    Harminc, M
    Soták, R
    DISCRETE MATHEMATICS, 2001, 233 (1-3) : 127 - 132
  • [43] Computing the Weighted Isolated Scattering Number of Interval Graphs in Polynomial Time
    Li, Fengwei
    Zhang, Xiaoyan
    Ye, Qingfang
    Sun, Yuefang
    COMPLEXITY, 2019, 2019
  • [44] Extreme Graphs with Given Order and Edge-Neighbor-Scattering Number
    Wei, Zongtian
    Qi, Nannan
    2012 2ND INTERNATIONAL CONFERENCE ON UNCERTAINTY REASONING AND KNOWLEDGE ENGINEERING (URKE), 2012, : 71 - 73
  • [45] QUICK DETERMINATION OF AVERAGE ATOMIC NUMBER Z BY X-RAY SCATTERING
    KUNZENDORF, H
    NUCLEAR INSTRUMENTS & METHODS, 1972, 99 (03): : 611 - +
  • [46] Dependence on average atomic number of coherent/incoherent scattering intensity ratios in compounds
    Sögüt, Ö
    Küçükönder, A
    Büyükkasap, E
    JOURNAL OF QUANTITATIVE SPECTROSCOPY & RADIATIVE TRANSFER, 2004, 87 (01): : 15 - 23
  • [47] Average sampling and average splines on combinatorial graphs
    Pesenson, Isaac Z.
    2019 13TH INTERNATIONAL CONFERENCE ON SAMPLING THEORY AND APPLICATIONS (SAMPTA), 2019,
  • [48] Average scattering entropy for periodic, aperiodic and random distribution of vertices in simple quantum graphs
    Silva, Alison A.
    Andrade, Fabiano M.
    Bazeia, D.
    PHYSICA E-LOW-DIMENSIONAL SYSTEMS & NANOSTRUCTURES, 2022, 141
  • [49] Average number of events and average reward
    Mi, J
    PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES, 2000, 14 (04) : 485 - 510
  • [50] THE NUMBER OF GRAPHS AND DIRECTED GRAPHS
    HARARY, F
    BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1952, 58 (06) : 664 - 664