Connectivity in Hypergraphsdoi:10.4153/CMB-2018-005-9Megan DewarDavid PikeJohn ProosCanadian Mathematical Society
In this chapter we introduce the hypergraph as the mathematical model of multibus systems. The fault-tolerance problem of a multibus system is transformed into the connectivity problem of its hypergraph. First, an important inequality related to all hypergraphs is stated and proved, and when there...
The analytic connectivity, proposed as a substitute of the algebraic connectivity in the setting of hypergraphs, is an important quantity in spectral hypergraph theory. The definition of the analytic connectivity for a uniform hypergraph involves a series of optimization problems (POPs) associated with ...
Augmenting hypergraphs by edges of size two 1992] A. Frank, Augmenting graphs to meet edge-connectivity requirements, SIAM J. on Discrete Mathe- matics, (1992 February), Vol.5, No 1., pp... J Bang-Jensen,B Jackson - 《Mathematical Programming》 被引量: 40发表: 1999年 Connected Segmenta...
Edge splitting and connectivity augmenta- tion in directed hypergraphs. Discrete Math., 273(1-3) (2003), 71-84. EuroComb'01 (Barcelona).Berg, A., Jackson, B., Jordan, T.: Edge splitting and connectivity augmentation in directed hypergraphs. Discrete Math. 273, 71-84 (2003)...
Edge-Connectivity Augmentations ofGraphsandHypergraphs A. Frank (Augmenting graphs to meet edge-connectivity requirements, SIAM J. Discrete Math. 5(1), 22–53, 1992) developed a method to solve edge-connectivity augmentation problems. His paper has stimula Z Szigeti 被引量: 17发表: 2009年 A ...
We study in this paper two parameters related to the fault-tolerance of directed bus networks: the connectivity and the fault-diameter of directed hypergraphs. Some bounds are given for those parameters. As a consequence, we obtain that de Bruijn-Kautz directed hypergraphs and, more generally, ...
The diffusive logistic model with a free boundary in a heterogeneous time-periodic environment Journal of Differential Equations, Volume 263, Issue 5, 2017, pp. 2736-2779 Weiwei Ding,…, Lei Wei View PDF Distance (signless) Laplacian spectral radius of uniform hypergraphs Linear Algebra and its ...
In this paper, we finish thetask by showing that the conjecture holds in the strongest possible sense, thatis, it holds right at the time the random graph process creates a connectedgraph. Moreover, we generalize and investigate the problem for randomhypergraphs....
In this work we show that among all n-vertex graphs with edge or vertex connectivity k, the graph G = K k ∨ ( K 1 + K n k 1 ), the join of K k, the complete graph on k vertices, with the disjoint union of K 1 and K n k 1, is the unique graph with maximum sum of...