Application of Tikhonov Regularization in Generalized Inverse of Adjacency Matrix of Undirected Graph
Abstract
In this paper, we found the Moore-Penrose generalized inverse of adjacency matrix of an undirected graph, explicitly. We proved that the matrix Rλ= [rij] is nonsingular where rii=1λ+ vi and rij= NG(Vi) NG(Vj) for i≠ j, and we proved that AG=[sij]1≤ i, j ≤ n where sij=sji=λ → +∞ R-1λej, fi . The proof of the main result was based on the Tikhonov regularization.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.