论文信息 - Factorization of product graphs for partitioning and domain decomposition - 字舞流文

Factorization of product graphs for partitioning and domain decomposition

A. Kaveh | K. Laknejadi

[1] Wilfried Imrich,et al. Recognizing Cartesian products in linear time , 2007, Discret. Math..

[2] Franz Aurenhammer,et al. Cartesian graph factorization at logarithmic cost per edge , 1992, computational complexity.

[3] Ali Kaveh,et al. A new spectral method for nodal ordering of regular space structures , 2004 .

[4] W. Imrich,et al. Product Graphs: Structure and Recognition , 2000 .

[5] D. Cvetkovic,et al. Spectra of Graphs: Theory and Applications , 1997 .

[6] Ali Kaveh,et al. Optimal Structural Analysis , 1997 .

[7] D. West. Introduction to Graph Theory , 1995 .

[8] Ali Kaveh,et al. Structural Mechanics: Graph and Matrix Methods , 1995 .

[9] B. Mohar. THE LAPLACIAN SPECTRUM OF GRAPHS y , 1991 .

[10] J. J. Seidel,et al. Graphs and their spectra , 1989 .

[11] Joan Feigenbaum,et al. A polynomial time algorithm for finding the prime factors of cartesian-product graphs , 1985, Discret. Appl. Math..

[12] M. Fiedler. Algebraic connectivity of graphs , 1973 .