Connectedness of digraphs from quadratic polynomials
From MaRDI portal
Recommendations
- On polynomial digraphs
- ON THE VERTEX CONNECTIVITY POLYNOMIAL OF GRAPHS
- The quadratic digraph on polynomial rings over finite fields
- Connectivity of some algebraically defined digraphs
- Connected domination polynomial of graphs
- Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph
- Determining finite connected graphs along the quadratic embedding constants of paths
- CONNECTED VERTEX-EDGE DOMINATION POLYNOMIALS OF SOME GRAPHS
- Chromatic polynomials of connected graphs
- Connectednesses of graphs and congruences
Cites work
Cited in
(6)- The Laplacian quadratic form and edge connectivity of a graph
- Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph
- scientific article; zbMATH DE number 6300018 (Why is no real title available?)
- On the symmetry graph of prime numbers
- Products of p+a and the graphs of I. Katai
- scientific article; zbMATH DE number 4212087 (Why is no real title available?)
This page was built for publication: Connectedness of digraphs from quadratic polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2309725)