Upper bound on the third edge-connectivity of graphs (Q2574674): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Latest revision as of 08:37, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Upper bound on the third edge-connectivity of graphs |
scientific article |
Statements
Upper bound on the third edge-connectivity of graphs (English)
0 references
30 November 2005
0 references
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)\).
0 references