On the edge reconstruction of the second immanantal polynomials of undirected graph and digraph
Abstract
Let be an matrix. The second immanant of matrix 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 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.
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}
}