On the edge reconstruction of the second immanantal polynomials of undirected graph and digraph
Abstract
Let M=(mij) be an n× n matrix. The second immanant of matrix M is defined by eqnarray* d2(M)=Σσ∈ Sn2(σ)Πs=1nmsσ(s), eqnarray* where 2 is the irreducible character of Sn corresponding to the partition (21,1n-2). The polynomial d2(xI-M) is called the second immanantal polynomial of matrix M. Denote by D(G) (resp. D(G)) and A(G) (resp. A(G)) the diagonal matrix of vertex degrees and the adjacency matrix of undirected graph G (resp. digraph G), respectively. In this article, we prove that d2(xI-A(G)) (resp. d2(xI-A(G))) can be reconstructed from the second immanantal polynomials of the adjacency matrix of all subgraphs in \G-uv,G-u-v|uv∈ E(G)\ (resp. \G-e|e∈ E(G)\). Furthermore, the polynomial d2(xI-D(G) A(G)) can also be reconstructed by the second immanantal polynomials of the (signless) Laplacian matrixs of all subgraphs in \G-e|e∈ E(G)\, respectively.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.