English

Application of Tikhonov Regularization in Generalized Inverse of Adjacency Matrix of Undirected Graph

Combinatorics 2022-03-01 v1

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]R_\lambda= [r_{ij}] is nonsingular where rii=1λ+degvir_{ii}=\frac{1}{\lambda}+ \deg v_i and rij=NG(Vi)NG(Vj)r_{ij}=\mid N_G(V_i)\cap N_G(V_j)\mid for iji\neq j, and we proved that AG=[sij]1i,jnA^{\dagger}_G=[s_{ij}]_{1\leq i, j \leq n} where sij=sji=limλ+Rλ1ej,fi\displaystyle{s_{ij}=s_{ji}=\lim_{\lambda \rightarrow +\infty} \langle R^{-1}_{\lambda}e_j, f_i \rangle }. The proof of the main result was based on the Tikhonov regularization.

Keywords

Cite

@article{arxiv.2202.12895,
  title  = {Application of Tikhonov Regularization in Generalized Inverse of Adjacency Matrix of Undirected Graph},
  author = {Paul Ryan Longhas and Alsafat Abdul},
  journal= {arXiv preprint arXiv:2202.12895},
  year   = {2022}
}

Comments

6, articles