Bounds on the size of graphs of given order and \(l\)-connectivity (Q1292831): Difference between revisions

The \(l\)-connectivity of a graph \(G\) of order \(p\) is the minimum number of vertices that have to be deleted from \(G\) to obtain a graph with at least \(l\) components or with fewer than \(l\) vertices. The authors provide bounds on the size of a graph of given order and \(l\)-connectivity.

0 references

reviewed by

Peter Horák

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

\(l\)-connectivity

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

0 references

0 references

0 references

Tough graphs and Hamiltonian circuits.

0 references

On the Toughness of a Graph

0 references

THE MAXIMUM CONNECTIVITY OF A GRAPH

0 references

On the \(\ell\)-connectivity of a graph

0 references

Q5661539

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1292831

@@ Property / cites work @@
+Q4873795
@@ Property / cites work: Q4873795 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3335824
@@ Property / cites work: Q3335824 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3818315
@@ Property / cites work: Q3818315 / rank @@
+Normal rank
@@ Property / cites work @@
+Tough graphs and Hamiltonian circuits.
@@ Property / cites work: Tough graphs and Hamiltonian circuits. / rank @@
+Normal rank
@@ Property / cites work @@
+On the Toughness of a Graph
@@ Property / cites work: On the Toughness of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+THE MAXIMUM CONNECTIVITY OF A GRAPH
@@ Property / cites work: THE MAXIMUM CONNECTIVITY OF A GRAPH / rank @@
+Normal rank
@@ Property / cites work @@
+On the \(\ell\)-connectivity of a graph
@@ Property / cites work: On the \(\ell\)-connectivity of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q5661539
@@ Property / cites work: Q5661539 / rank @@
+Normal rank