AbstractTwo natural linear models associated with a graph are considered. The Gauss–Markov theorem is used in one of the models to derive a combinatorial formula for the Moore–Penrose inverse of the incidence matrix of a tree. An inequality involving the Moore–Penrose inverse of the Laplacian matrix of a graph and its distance matrix is obtained. The case of equality is discussed. Again the main tool used in the proof is the theory of linear estimation
AbstractA tree with attached graphs is a tree, together with graphs defined on its partite sets. We ...
The introductory chapters in this paper review the concept of a generalized inverse for arbitrary ma...
In this work, we obtain the group inverse of the combinatorial Laplacian matrix of distance-biregula...
AbstractTwo natural linear models associated with a graph are considered. The Gauss–Markov theorem i...
Let T be a tree with n vertices, where each edge is given an orientation, and let Q be its vertex-ed...
A square matrix L is called a Laplacian-like matrix if Lj = 0 and j(T) L = 0. A square matrix D is l...
We consider the computation of generalized inverses of the graph Laplacian for both undirected and d...
We investigate the relationship between the structure of a discrete graphical model and the support ...
Let $G$ be a connected graph on $n$ vertices and $d_{ij}$ be the length of the shortest path between...
Abstract–In this article, some interesting applications of generalized inverses in the graph theory ...
AbstractIf A is a real symmetric matrix and P is an orthogonal projection onto a hyperplane, then we...
AbstractWe consider distance matrices of certain graphs and of points chosen in a rectangular grid. ...
Theory of linear estimation and applicability to problems of smoothing, filtering, extrapolation, an...
A tree with attached graphs is a tree, together with graphs defined on its partite sets. We introduc...
In this note, we first present three different types of generalized inverse matrices (conditional, l...
AbstractA tree with attached graphs is a tree, together with graphs defined on its partite sets. We ...
The introductory chapters in this paper review the concept of a generalized inverse for arbitrary ma...
In this work, we obtain the group inverse of the combinatorial Laplacian matrix of distance-biregula...
AbstractTwo natural linear models associated with a graph are considered. The Gauss–Markov theorem i...
Let T be a tree with n vertices, where each edge is given an orientation, and let Q be its vertex-ed...
A square matrix L is called a Laplacian-like matrix if Lj = 0 and j(T) L = 0. A square matrix D is l...
We consider the computation of generalized inverses of the graph Laplacian for both undirected and d...
We investigate the relationship between the structure of a discrete graphical model and the support ...
Let $G$ be a connected graph on $n$ vertices and $d_{ij}$ be the length of the shortest path between...
Abstract–In this article, some interesting applications of generalized inverses in the graph theory ...
AbstractIf A is a real symmetric matrix and P is an orthogonal projection onto a hyperplane, then we...
AbstractWe consider distance matrices of certain graphs and of points chosen in a rectangular grid. ...
Theory of linear estimation and applicability to problems of smoothing, filtering, extrapolation, an...
A tree with attached graphs is a tree, together with graphs defined on its partite sets. We introduc...
In this note, we first present three different types of generalized inverse matrices (conditional, l...
AbstractA tree with attached graphs is a tree, together with graphs defined on its partite sets. We ...
The introductory chapters in this paper review the concept of a generalized inverse for arbitrary ma...
In this work, we obtain the group inverse of the combinatorial Laplacian matrix of distance-biregula...