scholarly journals The p-restricted edge-connectivity of Kneser graphs

2019 ◽  
Vol 343 ◽  
pp. 258-267
Author(s):  
C. Balbuena ◽  
X. Marcote
Keyword(s):  
Edge Connectivity ◽  
Kneser Graphs

Short proof that Kneser graphs are Hamiltonian for n ⩾ 4k

2021 ◽  
Vol 344 (7) ◽  
pp. 112430
Author(s):  
Johann Bellmann ◽  
Bjarne Schülke
Keyword(s):  
Short Proof ◽  
Kneser Graphs

scholarly journals The Edge-Connectivity of Token Graphs

2021 ◽  
Vol 37 (3) ◽  
pp. 1013-1023
Author(s):  
J. Leaños ◽  
Christophe Ndjatchi
Keyword(s):  
Edge Connectivity

On the neighborhood complex of s→-stable Kneser graphs

2021 ◽  
Vol 344 (4) ◽  
pp. 112302
Author(s):  
Hamid Reza Daneshpajouh ◽  
József Osztényi
Keyword(s):  
Neighborhood Complex ◽  
Kneser Graphs

scholarly journals Spectral Threshold for Extremal Cyclic Edge-Connectivity

2021 ◽  
Author(s):  
Sinan G. Aksoy ◽  
Mark Kempton ◽  
Stephen J. Young
Keyword(s):  
Edge Connectivity ◽  
Cyclic Edge Connectivity

AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY

2006 ◽  
Vol 17 (03) ◽  
pp. 677-701 ◽  
Author(s):  
YUNG H. TSIN
Keyword(s):  
Distributed Algorithm ◽  
Computer Network ◽  
Connected Components ◽  
Message Complexity ◽  
Edge Connectivity ◽  
Worst Case ◽  
Dense Networks

A distributed algorithm for finding the cut-edges and the 3-edge-connected components of an asynchronous computer network is presented. For a network with n nodes and m links, the algorithm has worst-case [Formula: see text] time and O(m + nhT) message complexity, where hT < n. The algorithm is message optimal when [Formula: see text] which includes dense networks (i.e. m ∈ Θ(n2)). The previously best known distributed algorithm has a worst-case O(n3) time and message complexity.

scholarly journals Edge-connectivity and super edge-connectivity of P2-path graphs

2003 ◽  
Vol 269 (1-3) ◽  
pp. 13-20 ◽  
Author(s):  
Camino Balbuena ◽  
Daniela Ferrero
Keyword(s):  
Edge Connectivity

scholarly journals Liftings in Finite Graphs and Linkages in Infinite Graphs with Prescribed Edge-Connectivity

2016 ◽  
Vol 32 (6) ◽  
pp. 2575-2589
Author(s):  
Seongmin Ok ◽  
R. Bruce Richter ◽  
Carsten Thomassen
Keyword(s):  
Infinite Graphs ◽  
Edge Connectivity ◽  
Finite Graphs
Sign in / Sign up

Export Citation Format

Share Document