Abstract
The scattering number of a graph G is defined as s(G)=max{ω(G−X)−|X|:X⊂V(G),ω(G−X)>1}, where X is a cut set of G, and ω(G−X) denotes the number of components in G−X, which can be used to measure the vulnerability of network G. In this paper, we generalize this parameter to a hypergraph to measure the vulnerability of uniform hypergraph networks. Firstly, some bounds on the scattering number are given. Secondly, the relations of scattering number between a complete k-uniform hypergraph and complete bipartite k-uniform hypergraph are discussed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
