Graph products with specified domains for configuration processing and formation of the adjacency matrices

2010 ◽  
Vol 27 (2) ◽  
pp. 205-224 ◽  
Author(s):  
A. Kaveh ◽  
B. Alinejad
Keyword(s):  
Graph Products ◽  
Adjacency Matrices

scholarly journals Quantum walks defined by digraphs and generalized Hermitian adjacency matrices

2021 ◽  
Vol 20 (3) ◽  
Author(s):  
Sho Kubota ◽  
Etsuo Segawa ◽  
Tetsuji Taniguchi
Keyword(s):  
Quantum Walks ◽  
Adjacency Matrices

scholarly journals Iterative Methods for the Computation of the Perron Vector of Adjacency Matrices

Mathematics ◽  
2021 ◽  
Vol 9 (13) ◽  
pp. 1522
Author(s):  
Anna Concas ◽  
Lothar Reichel ◽  
Giuseppe Rodriguez ◽  
Yunzi Zhang
Keyword(s):  
Iterative Methods ◽  
Adjacency Matrix ◽  
Lanczos Method ◽  
Power Method ◽  
Arnoldi Method ◽  
Multiple Eigenvalues ◽  
Computer Storage ◽  
Adjacency Matrices ◽  
Lanczos Methods ◽  
Perron Vector

The power method is commonly applied to compute the Perron vector of large adjacency matrices. Blondel et al. [SIAM Rev. 46, 2004] investigated its performance when the adjacency matrix has multiple eigenvalues of the same magnitude. It is well known that the Lanczos method typically requires fewer iterations than the power method to determine eigenvectors with the desired accuracy. However, the Lanczos method demands more computer storage, which may make it impractical to apply to very large problems. The present paper adapts the analysis by Blondel et al. to the Lanczos and restarted Lanczos methods. The restarted methods are found to yield fast convergence and to require less computer storage than the Lanczos method. Computed examples illustrate the theory presented. Applications of the Arnoldi method are also discussed.

scholarly journals Optimizing quadratic forms of adjacency matrices of trees and related eigenvalue problems

2001 ◽  
Vol 325 (1-3) ◽  
pp. 191-207
Author(s):  
Wai-Shun Cheung ◽  
Chi-Kwong Li ◽  
D.D. Olesky ◽  
P. van den Driessche
Keyword(s):  
Quadratic Forms ◽  
Eigenvalue Problems ◽  
Adjacency Matrices

Adjacency matrices of polarity graphs and of other C 4-free graphs of large size

2010 ◽  
Vol 55 (2-3) ◽  
pp. 221-233 ◽  
Author(s):  
M. Abreu ◽  
C. Balbuena ◽  
D. Labbate
Keyword(s):  
Large Size ◽  
Adjacency Matrices

scholarly journals Strongly distance-balanced graphs and graph products

2009 ◽  
Vol 30 (5) ◽  
pp. 1048-1053 ◽  
Author(s):  
Kannan Balakrishnan ◽  
Manoj Changat ◽  
Iztok Peterin ◽  
Simon Špacapan ◽  
Primož Šparl ◽  
...  
Keyword(s):  
Graph Products ◽  
Balanced Graphs

On two conjectures on b-coloring of graph products

2017 ◽  
Vol 54 (1) ◽  
pp. 141-149
Author(s):  
S. Francis Raj ◽  
T. Kavaskar
Keyword(s):  
Graph Products
Sign in / Sign up

Export Citation Format

Share Document