Table of Contents
Fetching ...

On the edge reconstruction of the second immanantal polynomials of undirected graph and digraph

Tingzeng Wu, Yafan Geng, Hong-Jian Lai

TL;DR

The paper addresses the edge reconstruction of the second immanantal polynomial for graphs and digraphs by deriving recurrence relations that express the original polynomials in terms of those of edge- or vertex-deleted subgraphs. Specifically, for undirected graphs with $m\neq n$, it proves that the second immanantal polynomial $\tau(G;x)$ is uniquely reconstructible from $\{\tau(G-e;x), \tau(G-v_sv_t;x), \tau(G-v_s-v_t;x)\}$, while for digraphs it shows a similar reconstructibility for $g_i(\overrightarrow{G};x)$ from $\{g_i(\overrightarrow{G}-\overrightarrow{e};x)\}$. The work generalizes to Laplacian-type polynomials $d_{2}(xI-\eta D(\overrightarrow{G})-\alpha A(\overrightarrow{G}))$, asserting reconstructibility from corresponding subgraphs. These results connect the edge-reconstruction problem with spectral-type invariants based on immanants, contributing to the broader program motivated by Ulam–Kelly’s and Harary’s conjectures and offering a toolkit for recovering graph-wide polynomial invariants from substructure data.

Abstract

Let $M=(m_{ij})$ be an $n\times n$ matrix. The second immanant of matrix $M$ is defined by \begin{eqnarray*} d_{2}(M)=\sum_{σ\in S_{n}}χ_{2}(σ)\prod_{s=1}^{n}m_{sσ(s)}, \end{eqnarray*} where $χ_{2}$ is the irreducible character of $S_{n}$ corresponding to the partition $(2^{1},1^{n-2})$. The polynomial $d_{2}(xI-M)$ is called the second immanantal polynomial of matrix $M$. Denote by $D(G)$ (resp. $D(\overrightarrow{G})$) and $A(G)$ (resp. $A(\overrightarrow{G})$) the diagonal matrix of vertex degrees and the adjacency matrix of undirected graph $G$ (resp. digraph $\overrightarrow{G}$), respectively. In this article, we prove that $d_{2}(xI-A(G))$ (resp. $d_{2}(xI-A(\overrightarrow{G}))$) can be reconstructed from the second immanantal polynomials of the adjacency matrix of all subgraphs in $\{G-uv,G-u-v|uv\in E(G)\}$ (resp. $\{\overrightarrow{G}-e|e\in E(\overrightarrow{G})\}$). Furthermore, the polynomial $d_{2}(xI-D(\overrightarrow{G})\pm A(\overrightarrow{G}))$ can also be reconstructed by the second immanantal polynomials of the (signless) Laplacian matrixs of all subgraphs in $\{\overrightarrow{G}-e|e\in E(\overrightarrow{G})\}$, respectively.

On the edge reconstruction of the second immanantal polynomials of undirected graph and digraph

TL;DR

The paper addresses the edge reconstruction of the second immanantal polynomial for graphs and digraphs by deriving recurrence relations that express the original polynomials in terms of those of edge- or vertex-deleted subgraphs. Specifically, for undirected graphs with , it proves that the second immanantal polynomial is uniquely reconstructible from , while for digraphs it shows a similar reconstructibility for from . The work generalizes to Laplacian-type polynomials , asserting reconstructibility from corresponding subgraphs. These results connect the edge-reconstruction problem with spectral-type invariants based on immanants, contributing to the broader program motivated by Ulam–Kelly’s and Harary’s conjectures and offering a toolkit for recovering graph-wide polynomial invariants from substructure data.

Abstract

Let be an matrix. The second immanant of matrix is defined by \begin{eqnarray*} d_{2}(M)=\sum_{σ\in S_{n}}χ_{2}(σ)\prod_{s=1}^{n}m_{sσ(s)}, \end{eqnarray*} where is the irreducible character of corresponding to the partition . The polynomial is called the second immanantal polynomial of matrix . Denote by (resp. ) and (resp. ) the diagonal matrix of vertex degrees and the adjacency matrix of undirected graph (resp. digraph ), respectively. In this article, we prove that (resp. ) can be reconstructed from the second immanantal polynomials of the adjacency matrix of all subgraphs in (resp. ). Furthermore, the polynomial can also be reconstructed by the second immanantal polynomials of the (signless) Laplacian matrixs of all subgraphs in , respectively.

Paper Structure

This paper contains 4 sections, 10 theorems, 71 equations.

Key Result

Lemma 2.2

(12) Let $B=(b_{st})_{n\times n}$ and $B_{[ij]}=(b_{st}^{ij})_{n\times n}$ be defined as in Definition def2.1. Then the determinant of $B$ satisfies:

Theorems & Definitions (21)

  • Conjecture 1
  • Conjecture 2
  • Definition 2.1
  • Example 1
  • Lemma 2.2
  • Lemma 2.3
  • proof
  • Lemma 2.4
  • proof
  • Lemma 2.5
  • ...and 11 more