The maximum number of connected sets in regular graphs
From MaRDI portal
Vertex degrees (05C07) Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Connectivity (05C40) Expander graphs (05C48) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85)
Cites work
- A Dynamic Programming Approach to Sequencing Problems
- A simple proof of the Gan-Loh-Sudakov conjecture
- Attainable bounds for algebraic connectivity and maximally connected regular graphs
- Depth-First Search and Linear Graph Algorithms
- Dynamic Programming Treatment of the Travelling Salesman Problem
- Fast generation of regular graphs and construction of cages
- Finding optimal Bayesian network given a super-structure
- House of graphs 2.0: a database of interesting graphs and more
- Many \(T\) copies in \(H\)-free graphs
- Maximizing algebraic connectivity for certain families of graphs
- Minimum connected dominating sets of random cubic graphs
- Old and new results on algebraic connectivity of graphs
- On the average number of nodes in a subtree of a tree
- On the mean connected induced subgraph order of cographs
- On the number of connected sets in bounded degree graphs
- Regular Turán numbers and some Gan–Loh–Sudakov‐type problems
- Some intersection theorems for ordered sets and graphs
- The average size of a connected vertex set of a graph—Explicit formulas and open problems
- The number and average size of connected sets in graphs with degree constraints
- The traveling salesman problem in bounded degree graphs
Cited in
(2)
This page was built for publication: The maximum number of connected sets in regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7016792)
