On small cuts separating an abelian Cayley graph into two equal parts

DOI10.1007/BF01192695zbMATH Open0856.05050OpenAlexW2005417894MaRDI QIDQ4887489FDOQ4887489

Authors: Oriol Serra, Yahya Ould Hamidoune 

Publication date: 18 September 1996

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01192695

Recommendations

• Small cutsets in quasiminimal Cayley graphs
• Node bisectors of Cayley graphs
• Bounds on mincut for Cayley graphs over Abelian groups

zbMATH Keywords

Cayley graphabelian groupseparating set

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cites Work

• On the diameter and bisector size of Cayley graphs

Cited In (6)

• Bounds on mincut for Cayley graphs over Abelian groups
• Small separations in vertex-transitive graphs
• Random walks, bisections and gossiping in circulant graphs
• Yahya Ould Hamidoune's mathematical journey: a critical review of his work
• Minimal cutwidth linear arrangements of abelian Cayley graphs
• On extending Pollard's theorem for \(t\)-representable sums

This page was built for publication: On small cuts separating an abelian Cayley graph into two equal parts

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