On minimally 2-connected graphs with generalized connectivity $$\kappa _{3}=2$$κ3=2
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-016-0075-z
Abstract: For $$S\subseteq G$$S⊆G, let $$\kappa (S)$$κ(S) denote the maximum number r of edge-disjoint trees $$T_1, T_2, \ldots , T_r$$T1,T2,…,Tr in G such that $$V(T_i)\cap V(T_j)=S$$V(Ti)∩V(Tj)=S for any $$i,j\in \{1,2,\ldots ,r\}$$i,j∈{1,2,…,r} and $$i\ne j$$i≠j. For every… read more here.
Keywords: graphs; connectivity; graphs generalized; kappa ... See more keywords