论文信息 - Fault diameter of interconnection networks - 字舞流文

Fault diameter of interconnection networks

M. Krishnamoorthy | B. Krishnamurthy

[1] H. Coxeter. Self-dual configurations and regular graphs , 1950 .

[2] Sheldon B. Akers,et al. On the Construction of (d, k) Graphs , 1965, IEEE Trans. Electron. Comput..

[3] Frank Harary,et al. Graph Theory , 2016 .

[4] Kozo Bannai. Hamiltonian cycles in generalized petersen graphs , 1978, J. Comb. Theory, Ser. B.

[5] Michael Capobianco,et al. Examples and Counterexamples in Graph Theory , 1978, J. Graph Theory.

[6] Jerald A. Kabell,et al. The crossing numbers of some generalized Petersen graphs. , 1981 .

[7] Franco P. Preparata,et al. The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[8] Geoffrey Exoo,et al. A counterexample to a conjecture on paths of bounded length , 1982, J. Graph Theory.

[9] Pavol Hell,et al. Counterexamples to theorems of Menger type for the diameter , 1983, Discret. Math..

[10] Geoffrey Exoo. On line disjoint paths of bounded length , 1983, Discret. Math..