FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR

Abstract A first kind Frobenius graph is a Cayley graph Cay(K,S) on the Frobenius kernel of a Frobenius group $K \rtimes H$ such that S=aH for some a∈K with 〈aH〉=K, where H is of even order or a is an involution. It is known that such graphs admit ‘perfect’ routing and gossiping schemes. A circulant graph is a Cayley graph on a cyclic group of order at least three. Since circulant graphs are widely used as models for interconnection networks, it is thus highly desirable to characterize those which are Frobenius of the first kind. In this paper we first give such a characterization for connected 4-valent circulant graphs, and then describe optimal routing and gossiping schemes for those which are first kind Frobenius graphs. Examples of such graphs include the 4-valent circulant graph with a given diameter and maximum possible order.

[1]  Chak-Kuen Wong,et al.  A Combinatorial Problem Related to Multimodule Memory Organizations , 1974, JACM.

[2]  Arthur L. Liestman,et al.  Network Properties of Double and Triple Fixed Step Graphs , 1998, Int. J. Found. Comput. Sci..

[3]  Stéphane Pérennes,et al.  Complete Rotations in Cayley Graphs , 2001, Eur. J. Comb..

[4]  H. Weyl.  Permutation Groups , 2022 .

[5]  Lata Narayanan,et al.  All-to-All Optical Routing in Chordal Rings of Degree 4 , 2001, Algorithmica.

[6]  Sanming Zhou.  A Class of Arc-Transitive Cayley Graphs as Models for Interconnection Networks , 2009, SIAM J. Discret. Math..

[7]  Stéphane Pérennes,et al.  Gossiping in Cayley Graphs by Packets , 1995, Combinatorics and Computer Science.

[8]  Marie-Claude Heydemann,et al.  On forwarding indices of networks , 1989, Discret. Appl. Math..

[9]  Marie-Claude Heydemann,et al.  Cayley graphs and interconnection networks , 1997 .

[10]  Cheryl E. Praeger,et al.  Finding Optimal Routings in Hamming Graphs , 2002, Eur. J. Comb..

[11]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[12]  E. T..  An Introduction to the Theory of Numbers , 1946, Nature.

[13]  Miquel Àngel Fiol Mora,et al.  The Diameter of undirected graphs associated to plane tessellations , 1985 .

[14]  W. Scott,et al.  Group Theory. , 1964 .

[15]  Cheryl E. Praeger,et al.  On orbital regular graphs and frobenius graphs , 1998, Discret. Math..

[16]  Frank K. Hwang,et al.  A survey on multi-loop networks , 2003, Theor. Comput. Sci..

[17]  Cai Heng Li,et al.  On isomorphisms of finite Cayley graphs--a survey , 2002, Discret. Math..

[18]  Arnold L. Rosenberg,et al.  Group Action Graphs and Parallel Architectures , 1990, SIAM J. Comput..

[19]  Jhing-Fa Wang,et al.  Reliable circulant networks with minimum transmission delay , 1985 .

[20]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[21]  Michael Rosen,et al.  A classical introduction to modern number theory , 1982, Graduate texts in mathematics.

[22]  Tomaz Pisanski,et al.  Computing the Diameter in Multiple-Loop Networks , 1993, J. Algorithms.

[23]  Sanming Zhou,et al.  Gossiping and routing in undirected triple‐loop networks , 2010, Networks.

[24]  Patrick Solé,et al.  The edge-forwarding index of orbital regular graphs , 1994, Discret. Math..