Mixed connectivity properties of random graphs and some special graphs

Ran Gu (), Yongtang Shi () and Neng Fan ()
Additional contact information
Ran Gu: Hohai University
Yongtang Shi: Nankai University
Neng Fan: University of Arizona

Journal of Combinatorial Optimization, No 0, 15 pages

Abstract: Abstract For positive integers k and $$\lambda $$ λ , a graph G is $$(k,\lambda )$$ ( k , λ ) -connected if it satisfies the following two conditions: (1) $$|V(G)|\ge k+1$$ | V ( G ) | ≥ k + 1 , and (2) for any subset $$S\subseteq V(G)$$ S ⊆ V ( G ) and any subset $$L\subseteq E(G)$$ L ⊆ E ( G ) with $$\lambda |S|+|L|

Keywords: Connectivity; Edge-connectivity; Mixed connectivity; Random graph; Threshold function; Hitting time (search for similar items in EconPapers)
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-019-00415-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v::y::i::d:10.1007_s10878-019-00415-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-019-00415-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().