Scattering number of digraphs

Jun Wang and Yuefang Sun

Applied Mathematics and Computation, 2024, vol. 466, issue C

Abstract: The scattering number of a strong digraph D is defined by s(D)=max{ω(D−R)−|R|}, where R and ω(D−R) respectively represent a separator of D and the number of strong components of D−R. This concept is a natural extension of the scattering number of undirected graphs which has a strong background of applications in measuring the vulnerability of networks.

Keywords: Scattering number; Cartesian product digraph (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300323006446
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:466:y:2024:i:c:s0096300323006446

DOI: 10.1016/j.amc.2023.128475

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().