Simplifying the computation of the spectrum of the complete k-uniform hypergraph
Sign Up to like & getrecommendations! Published in 2020 at "Linear Algebra and its Applications"
DOI: 10.1016/j.laa.2020.03.003
Abstract: Abstract In this paper, we give a method to simplify the computation of the spectrum of the complete k-uniform hypergraph with n vertices, which gives a partial answer to a question posed by Cooper and… read more here.
Keywords: spectrum complete; computation spectrum; hypergraph; uniform hypergraph ... See more keywords
A Measure for the Vulnerability of Uniform Hypergraph Networks: Scattering Number
Sign Up to like & getrecommendations! Published in 2024 at "Mathematics"
DOI: 10.3390/math12040515
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… read more here.
Keywords: number; uniform hypergraph; hypergraph; measure vulnerability ... See more keywords