Variation in $\alpha$ trace norm of a digraph by deletion of a vertex or an arc and its applications

TL;DR

This paper investigates how the $ ext{alpha}$ trace norm of a directed graph changes when vertices or arcs are removed, and characterizes certain digraphs with maximum $ ext{alpha}$ trace norm.

Contribution

It introduces the concept of $ ext{alpha}$ trace norm for digraphs and analyzes its variation under deletions, providing characterizations of extremal digraphs.

Findings

Derived bounds for $ ext{alpha}$ trace norm after deletions.

Characterized digraphs with maximum $ ext{alpha}$ trace norm.

Provided insights into the structure of extremal digraphs.

Abstract

Let $D$ be a digraph of order $n$ with adjacency matrix $A(D)$. For $\alpha\in[0,1)$, the $A_{\alpha}$ matrix of $D$ is defined as $A_{\alpha}(D)=\alpha {\Delta}^{+}(D)+(1-\alpha)A(D)$, where ${\Delta}^{+}(D)=\mbox{diag}~(d_1^{+},d_2^{+},\dots,d_n^{+})$ is the diagonal matrix of vertex outdegrees of $D$. Let $\sigma_{1\alpha}(D),\sigma_{2\alpha}(D),\dots,\sigma_{n\alpha}(D)$ be the singular values of $A_{\alpha}(D)$. Then the trace norm of $A_{\alpha}(D)$, which we call $\alpha$ trace norm of $D$, is defined as $\|A_{\alpha}(D)\|_*=\sum_{i=1}^{n}\sigma_{i\alpha}(D)$. In this paper, we study the variation in $\alpha$ trace norm of a digraph when a vertex or an arc is deleted. As an application of these results, we characterize oriented trees and unicyclic digraphs with maximum $\alpha$ trace norm.