Minimally \((n,\lambda)\)-connected graphs of low order and maximal size
From MaRDI portal
Publication:2573845
zbMATH Open1079.05050MaRDI QIDQ2573845
Publication date: 24 November 2005
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Related Items (3)
Minimal least eigenvalue of connected graphs of order \(n\) and size \(m = n + k\) (\(5 \leqslant k \leqslant 8\)) ⋮ Minimum order graphs with specified diameter, connectivity, and regularity ⋮ Title not available (Why is that?)
Recommendations
- Minimal \(k\)-connected graphs with minimal number of vertices of degree \(k\) 👍 👎
- Bounds on the size of graphs of given order and \(l\)-connectivity 👍 👎
- On minimally \((n,\lambda)\)-connected graphs 👍 👎
- Minimum statuses of connected graphs with fixed maximum degree and order 👍 👎
- On the maximum and minimum sizes of a graph with given \(k\)-connectivity 👍 👎
- Graphs of given order and size and minimum algebraic connectivity 👍 👎
- The minimum order of n-connected n-regular graphs with specified diameters 👍 👎
- Minimum order graphs with specified diameter, connectivity, and regularity 👍 👎
- Minimally (k, k)‐edge‐connected graphs 👍 👎
- Minimal k-connected Graphs with Small Number of Vertices of Degree k 👍 👎
This page was built for publication: Minimally \((n,\lambda)\)-connected graphs of low order and maximal size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2573845)
