Abstract
An edge-bisector of a graph is a set of edges whose removing separates the graph into two subgraphs of same order, within one. The edge-bisection of a graph is the cardinality of the smallest edge-bisector. The main purpose of this paper is to estimate the quality of general bounds on the edge-bisection of Cayley graphs. For this purpose we have focused on chordal rings of degree 3. These graphs are Cayley graphs on the dihedral group and can be considered as the simplest Cayley graphs on a non-abelian group (the dihedral group is metabelian). Moreover, the natural plane tessellation used to represent and manipulate these graphs can be generalized to other types of tessellations including abelian Cayley graphs. We have improved previous bounds on the edge-bisection of chordal rings and we have shown that, for any fixed chord, our upper bound on the edge-bisection of chordal rings is optimal up to an O(log n) factor. Finally, we have given tight bounds for optimal chordal rings, that are those with the maximum number of vertices for a given diameter.KeywordsPlanar GraphCayley GraphDihedral GroupTight BoundGossip ProtocolThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
