The average scattering number of graphs

DOI10.1051/ITA/2016027MaRDI QIDQ2956887zbMATH OpenOpenAlexFDO

Authors Ersin Aslan, Deniz Kilinc, Fatih Yücalar, Emin Borandağ

Publication date 19 January 2017

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ita/2016027

zbMATH Keywords

connectivityscattering numberrupture degreeaverage lower domination numberaverage lower independence number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Network design and communication in computer systems (68M10)

Recommendations

• Scattering number in graphs
• scientific article; zbMATH DE number 5925154
• A measure of graph vulnerability: Scattering number
• Isolated scattering number of split graphs and graph products
• Relationships between scattering number and other vulnerability parameters

Cites work

• scientific article; zbMATH DE number 989237 (Why is no real title available?)
• On a class of posets and the corresponding comparability graphs
• Relationships between scattering number and other vulnerability parameters
• Scattering number and modular decomposition
• Scattering number in graphs
• The average connectivity of a digraph
• Tough graphs and Hamiltonian circuits.

Cited in

(8)

• Scattering number of digraphs
• A measure of graph vulnerability: Scattering number
• Vertex-neighbor-scattering number of graphs.
• scientific article; zbMATH DE number 5925154 (Why is no real title available?)
• Scattering number in graphs
• The gathering number of a graph and vertex degrees
• Scattering number of the product of some special classes of graphs
• A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs

This page was built for publication: The average scattering number of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2956887)