English

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

Combinatorics 2025-02-19 v1

Abstract

Let M=(mij)M=(m_{ij}) be an n×nn\times n matrix. The second immanant of matrix MM is defined by \begin{eqnarray*} d_{2}(M)=\sum_{\sigma\in S_{n}}\chi_{2}(\sigma)\prod_{s=1}^{n}m_{s\sigma(s)}, \end{eqnarray*} where χ2\chi_{2} is the irreducible character of SnS_{n} corresponding to the partition (21,1n2)(2^{1},1^{n-2}). The polynomial d2(xIM)d_{2}(xI-M) is called the second immanantal polynomial of matrix MM. Denote by D(G)D(G) (resp. D(G)D(\overrightarrow{G})) and A(G)A(G) (resp. A(G)A(\overrightarrow{G})) the diagonal matrix of vertex degrees and the adjacency matrix of undirected graph GG (resp. digraph G\overrightarrow{G}), respectively. In this article, we prove that d2(xIA(G))d_{2}(xI-A(G)) (resp. d2(xIA(G))d_{2}(xI-A(\overrightarrow{G}))) can be reconstructed from the second immanantal polynomials of the adjacency matrix of all subgraphs in {Guv,GuvuvE(G)}\{G-uv,G-u-v|uv\in E(G)\} (resp. {GeeE(G)}\{\overrightarrow{G}-e|e\in E(\overrightarrow{G})\}). Furthermore, the polynomial d2(xID(G)±A(G))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 {GeeE(G)}\{\overrightarrow{G}-e|e\in E(\overrightarrow{G})\}, respectively.

Keywords

Cite

@article{arxiv.2502.12781,
  title  = {On the edge reconstruction of the second immanantal polynomials of undirected graph and digraph},
  author = {Tingzeng Wu and Yafan Geng and Hong-Jian Lai},
  journal= {arXiv preprint arXiv:2502.12781},
  year   = {2025}
}