The average scattering number of graphs

DOI10.1051/ita/2016027zbMath1353.05073OpenAlexW2559241849MaRDI QIDQ2956887

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

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

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

Related Items (1)

A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs

Cites Work

• Unnamed Item
• On a class of posets and the corresponding comparability graphs
• Scattering number and modular decomposition
• The average connectivity of a digraph
• Tough graphs and Hamiltonian circuits.
• Scattering number in graphs
• Relationships between scattering number and other vulnerability parameters

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