Upper bound on the third edge-connectivity of graphs (Q2574674): Difference between revisions

Let \(h\) be a positive integer and \(G\) a simple connected graph of order \(n\geq 2h\). At first, the authors begin with a precise actual terminology of edge-connectivity. They define the \(h\)-edge-connectivity of a graph \(G\), denoted by \(\lambda_h(G)\), and characterize those graphs \(G\) whose \(\lambda_3(G)\) is well defined, and then the authors give tight upper bound for \(\lambda_3(G)\).