Diameter of generalized Petersen graphs
暂无分享,去创建一个
[1] H. Coxeter. Self-dual configurations and regular graphs , 1950 .
[2] Tomaz Pisanski,et al. Computing the Diameter in Multiple-Loop Networks , 1993, J. Algorithms.
[3] Jun,et al. Wide Diameter of Generalized Petersen Graphs , 2010 .
[4] H. A. David,et al. Enumeration of cyclic graphs and cyclic designs , 1972 .
[5] Josep Fàbrega,et al. Fault-tolerant Routings in Double Fixed-step Networks , 1997, Discret. Appl. Math..
[6] James Turner. Point-symmetric graphs with a prime number of points , 1967 .
[7] M. Watkins,et al. A theorem on tait colorings with an application to the generalized Petersen graphs , 1969 .
[8] Wenjun Xiao,et al. Diameter formulas for a class of undirected double-loop networks , 2005, J. Interconnect. Networks.
[9] J. Graver,et al. The groups of the generalized Petersen graphs , 1971, Mathematical Proceedings of the Cambridge Philosophical Society.
[10] Ralph Tindell,et al. Circulants and their connectivities , 1984, J. Graph Theory.
[11] Chak-Kuen Wong,et al. A Combinatorial Problem Related to Multimodule Memory Organizations , 1974, JACM.
[12] Marko Lovrecic Sarazin. A Note on the Generalized Petersen Graphs That Are Also Cayley Graphs , 1997, J. Comb. Theory, Ser. B.
[13] Lali Barrière,et al. Fault-tolerant routings in chordal ring networks , 2000, Networks.
[14] J. H. van Lint,et al. OPTIMAL GENERALIZED PETERSEN GRAPHS , 1988 .
[15] D. Frank Hsu,et al. A combinatorial problem related to distributed loop networks , 1990, Networks.
[16] Martin Skoviera,et al. Which generalized petersen graphs are cayley graphs? , 1995, J. Graph Theory.
[17] M. Krishnamoorthy,et al. Fault diameter of interconnection networks , 1987 .
[18] F. Göbel,et al. Cyclic Graphs , 2000, Discret. Appl. Math..
[19] D. Frank Hsu,et al. Distributed Loop Computer Networks: A Survey , 1995, J. Parallel Distributed Comput..