Title of article
ON TRANSINVERSE OF MATRICES AND ITS APPLICATIONS
Author/Authors
Hameed ، Koombail Shahul Department of Mathematics - K M M Government Women’s College , Ramakrishnan ، Kunhumbidukka Othayoth Department of Mathematics - K M M Government Women’s College
From page
135
To page
147
Abstract
Given a matrix A with the elements from a field of characteristic zero, the transinverse A# of A is defined as the transpose of the matrix obtained by replacing the non-zero elements of A by their inverses and leaving zeros, if any, unchanged. We discuss the properties of this matrix operation in some detail and as an important application, we reinvent the celebrated matrix tree theorem for gain graphs. Characterization of balance in connected gain graphs using its Laplacian matrix becomes an immediate consequence.
Keywords
Gain graph , Signed graph , Graph eigenvalues , Graph Laplacian
Journal title
Journal of Algebraic Systems
Journal title
Journal of Algebraic Systems
Record number
2758327
Link To Document