A graph G is 2-connected iff any 2 vertices of G are connected by 2 internally disjoint paths
ฝัง
- เผยแพร่เมื่อ 20 ต.ค. 2024
- #AgraphGis2-connectediffanytwoverticesAreConnnectedAtleastByTwoInternallyDisjointPaths
#graphtheory #17mat #graph #thamil #17mat #independentedges #vertices #edges #connectedgraph #connectivity #kappa #Whitneytheorem #Whitney
@17matboy