The minimum rank of universal adjacency matrices

TL;DR

This paper introduces the minimum universal rank, a new graph parameter based on a family of matrices, providing bounds, exact values for specific graphs, and characterizations for low values.

Contribution

It defines the minimum universal rank, derives bounds, computes exact values for certain graph families, and characterizes graphs with minimal universal rank.

Findings

Exact minimum universal rank for complete graphs, bipartite graphs, paths, and cycles.

Bounds on the rank for graphs with vertex deletions.

Characterizations of graphs with minimum universal rank 0 and 1.

Abstract

In this paper we introduce a new parameter for a graph called the {\it minimum universal rank}. This parameter is similar to the minimum rank of a graph. For a graph $G$ the minimum universal rank of $G$ is the minimum rank over all matrices of the form \[ U(\alpha, \beta, \gamma, \delta) = \alpha A + \beta I + \gamma J + \delta D \] where $A$ is the adjacency matrix of $G$, $J$ is the all ones matrix and $D$ is the matrix with the degrees of the vertices in the main diagonal, and $\alpha\neq 0, \beta, \gamma, \delta$ are scalars. Bounds for general graphs based on known graph parameters are given, as is a formula for the minimum universal rank for regular graphs based on the multiplicity of the eigenvalues of $A$. The exact value of the minimum universal rank of some families of graphs are determined, including complete graphs, complete bipartite graph, paths and cycles. Bounds on the minimum universal rank of a graph obtained by deleting a single vertex are established. It is shown that the minimum universal rank is not monotone on induced subgraphs, but bounds based on certain induced subgraphs, including bounds on the union of two graphs, are given. Finally we characterize all graphs with minimum universal rank equal to 0 and to 1.