Enumeration of copermanental graphs

MaRDI QIDQ6256036zbMATH OpenFDO

Authors Shunqin Liu, Jinjun Ren

Publication date 1 November 2014

Mathematics Subject Classification ID

Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Determinants, permanents, traces, other special matrix functions (15A15)

Abstract: Let $G$ be a graph and $A$ the adjacency matrix of $G$. The permanental polynomial of $G$ is defined as $mathrmper(xI-A)$. In this paper some of the results from a numerical study of the permanental polynomials of graphs are presented. We determine the permanental polynomials for all graphs on at most 11 vertices, and count the numbers for which there is at least one other graph with the same permanental polynomial. The data give some indication that the fraction of graphs with a copermanental mate tends to zero as the number of vertices tends to infinity, and show that the permanental polynomial does be better than characteristic polynomial when we use them to characterize graphs.

This page was built for publication: Enumeration of copermanental graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6256036)