Degrees in a digraph whose nodes are graphs
An \(f\)-graph is an unlabeled graph having no vertices of degree greater than \(f\). The authors define the digraph \(D(n, f)\) whose node set is the set of \(f\)-graphs of order \(n\) and such that there is an arc from the node corresponding to graph \(H\) to the node corresponding to the graph \(K\) if and only if \(K\) is obtainable from \(H\) by the addition of a single edge. Some results for \(f= 2\) are reviewed and the node degrees in \(D(n, n- 1)\) are investigated. Also some comments are given for questions for \(D(n, f)\) where \(2\leq f< n- 1\).
- An intermediate value theorem for graphs with given automorphism group
- Extrema concerning asymmetric graphs
- scientific article; zbMATH DE number 1186727 (Why is no real title available?)
- scientific article; zbMATH DE number 4196022 (Why is no real title available?)
- Random Graph Processes with Degree Restrictions
- The maximum number of one-edge extensions for graphs with bounded degree.
- The sequential generation of random \(f\)-graphs. Distributions and predominant types of edge maximal \(f\)-graphs with \(f>4\)
- Digraphs with degree equivalent induced subdigraphs
- Graphs whose vertices are forests with bounded degree: planarity
- scientific article; zbMATH DE number 3868663 (Why is no real title available?)
- Degree-based graph construction
- scientific article; zbMATH DE number 4047777 (Why is no real title available?)
- scientific article; zbMATH DE number 2188439 (Why is no real title available?)
- The sequential generation of random \(f\)-graphs. Distributions and predominant types of edge maximal \(f\)-graphs with \(f>4\)
This page was built for publication: Degrees in a digraph whose nodes are graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1916093)
