Uniform scrambles on graphs

MaRDI QIDQ6072043zbMATH OpenFDO

Authors Lisa Cenek, Ralph Morrison

Publication date 29 November 2023

Full work available at URL https://arxiv.org/abs/2108.09821, http://ajc.maths.uq.edu.au/pdf/87/ajc_v87_p129.pdf

zbMATH Keywords

\(k\)-edge-connectivity\(k\)-restricted edge-connectivity\(k\)-uniform scramble

Mathematics Subject Classification ID

Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the scramble number of graphs
• Graphs of scramble number two
• A new lower bound on graph gonality
• Computing the Scattering Number of Graphs
• Primitive digraphs with the largest scrambling index

Cites work

• \(k\)-restricted edge-connectivity in triangle-free graphs
• A new lower bound on graph gonality
• Cycles in folded hypercubes
• Gonality of random graphs
• On the complexity of computing the \(k\)-restricted edge-connectivity of a graph
• On the extra edge-connectivity of hypercubes
• On the gonality of Cartesian products of graphs
• On the scramble number of graphs
• Self-dual configurations and regular graphs
• Specialization of linear systems from curves to graphs (with an appendix by Brian Conrad)
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected
• Super-edge-connectivity properties of graphs with diameter 2
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Treewidth is a lower bound on graph gonality

Cited in

(1)

• Fast scramblers, horizons and expander graphs

This page was built for publication: Uniform scrambles on graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6072043)