Related papers: On generalized inverses of matrices associated wit…

We present necessary and sufficient conditions under which the anti-triangular matrix $\left( \begin{array}{cc} a&b 1&0 \end{array} \right)$ over a Banach algebra has g-Drazin inverse. New additive results for g-Drazin inverse are obtained.…

An integer generalized spline is a set of vertex labels on an edge-labeled graph that satisfy the condition that if two vertices are joined by an edge, the vertex labels are congruent modulo the edge label. Foundational work on these…

Let $G$ be a graph and $A$ be its adjacency matrix. A graph $G$ is invertible if its adjacency matrix $A$ is invertible and the inverse of $G$ is a weighted graph with adjacency matrix $A^{-1}$. A signed graph $(G,\sigma)$ is a weighted…

Let G be a graph whose edges are labeled by positive integers. Label each vertex with an integer and suppose if two vertices are joined by an edge, the vertex labels are congruent to each other modulo the edge label. The set of vertex…

We prove a new generalisation of Ramsey's theorem by showing that every $2$-edge-coloured graph with sufficiently large minimum degree contains a monochromatic induced subgraph whose minimum degree remains large. From this, we also derive…

Let $R$ be a B\'ezout domain, and let $A,B,C\in R^{n\times n}$ with $ABA=ACA$. If $AB$ and $CA$ are group invertible, we prove that $AB$ is similar to $CA$. Moreover, we have $(AB)^{\#}$ is similar to $(CA)^{\#}$. This generalize the main…

We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…

We study first order differential operators with constant coefficients. The main question is under what conditions a generalized Poincar\'e inequality holds. We show that the constant rank condition is sufficient. The concept of the…

We consider modified Laplacian matrices of graphs, obtained by adding the identity matrix to the Laplacian matrix $L_G$ of a graph $G$. This results in a positive definite matrix $\tilde{L}_G$. The inverse of $\tilde{L}_G$ is a doubly…

For an oriented graph $D$ and a set $X\subseteq V(D)$, the inversion of $X$ in $D$ is the graph obtained from $D$ by reversing the orientation of each edge that has both endpoints in $X$. Define the inversion number of $D$, denoted…

Dotted graphs are certain finite graphs with vertices of degree 2 called dots in the $xy$-plane $\mathbb{R}^2$, and a dotted graph is said to be admissible if it is associated with a lattice polytope in $\mathbb{R}^2$ each of whose edge is…

Let $D$ be an oriented graph with skew adjacency matrix $S(D)$. Two oriented graphs $D$ and $C$ are said to share the same generalized skew spectrum if $S(D)$ and $S(C)$ have the same eigenvalues, and $J-S(D)$ and $J-S(C)$ also have the…

In 2020, Cameron et al. introduced the restricted numerical range of a digraph (directed graph) as a tool for characterizing digraphs and studying their algebraic connectivity. In particular, digraphs with a restricted numerical range of a…

In this paper we investigate the $directed$ $normalizing$ $graph$ associated with a group $G$, defined as the simple directed graph whose vertices are the elements of $G$, with an arrow from $x$ to $y$ whenever the subgroup $\langle x…

An element $a$ in a Banach algebra $\mathcal{A}$ has g-Drazin inverse if there exists $b\in \mathcal{A}$ such that $ab=ba, b=bab$ and $a-a^2b \in \mathcal{A}^{qnil}$. In this paper we find new explicit representations of the g-Drazin…

The general position number for graphs ask for largest vertex subsets $S$ such that no three vertices are contained on a common shortest path. We examine this problem in the setting of directed graphs. We provide bounds for the general…

To a given nonsingular triangular matrix A with entries from a ring, we associate a weighted bipartite graph G(A) and give a combinatorial description of the inverse of A by employing paths in G(A). Under a certain condition, nonsingular…

A divide-and-conquer based approach for computing the Moore-Penrose pseudo-inverse of the combinatorial Laplacian matrix $(\bb L^+)$ of a simple, undirected graph is proposed. % The nature of the underlying sub-problems is studied in detail…

In this paper we derive necessary and sufficient conditions for the nonnegativity of Moore-Penrose inverses of unbounded Gram operators between real Hilbert spaces. These conditions include statements on acuteness of certain closed convex…

In the course of proving the strong perfect graph theorem, Chudnovsky, Robertson, Seymour, and Thomas showed that every perfect graph either belongs to one of five basic classes or admits one of several decompositions. Four of the basic…