Small cutsets in arc-transitive digraphs of prime degree
From MaRDI portal
(Redirected from Publication:2446348)
Recommendations
- On the vertex-stabiliser in arc-transitive digraphs
- Covering digraphs with small indegrees or outdegrees by directed cuts
- The smallest vertex-primitive 2-arc-transitive digraph
- Lower bounds of \(|X|\) and \(|Y|\) of edge-cut \( (X,Y)\) and maximality and superiority of a digraph
- Minimum cuts of distance-regular digraphs
Cites work
- A class of vertex-transitive digraphs
- Additive combinatorics
- An isoperimetric method in additive theory
- Circulants and their connectivities
- Connectivity of vertex and edge transitive graphs
- scientific article; zbMATH DE number 5117215 (Why is no real title available?)
- scientific article; zbMATH DE number 3547328 (Why is no real title available?)
- scientific article; zbMATH DE number 1498642 (Why is no real title available?)
- On complete subsets of the cyclic group
- On the Classification of Symmetric Graphs with a Prime Number of Vertices
- On the connectivity of Cayley digraphs
- On the critical pair theory in abelian groups: beyond Chowla's theorem
- On vosperian and superconnected vertex-transitive digraphs
- Some additive applications of the isoperimetric approach
- Some results in additive number theory I: The critical pair theory
- Sums of sets of group elements
- Super-connected arc-transitive digraphs
- Synthesis of reliable networks - a survey
- Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors
- Vosperian and superconnected abelian Cayley digraphs
This page was built for publication: Small cutsets in arc-transitive digraphs of prime degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446348)