Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Ryan Hessert"'
Autor:
Ryan Hessert, Sudipta Mallik
The vertex-edge incidence matrix of a (connected) unicyclic graph G is a square matrix which is invertible if and only if the cycle of G is an odd cycle. A combinatorial formula of the inverse of the incidence matrix of an odd unicyclic graph was kno
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8d77d748246894fbf6efb98a317b7216
http://arxiv.org/abs/2201.02580
http://arxiv.org/abs/2201.02580
Autor:
Sudipta Mallik, Ryan Hessert
The signless Laplacian Q and signless edge-Laplacian S of a given graph may or may not be invertible. The Moore-Penrose inverses of Q and S are studied. In particular, using the incidence matrix, we find combinatorial formulas of the Moore-Penrose in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ca49660185476b08637edb7397a9de4b
http://arxiv.org/abs/2005.03702
http://arxiv.org/abs/2005.03702