Permanental polynomials of skew adjacency matrices of oriented graphs

DOI10.13885/J.ISSN.0455-2059.2016.05.018MaRDI QIDQ5277004zbMATH OpenOpenAlexFDO

Authors Shunqin Liu, Heping Zhang

Publication date 14 July 2017

Full work available at URL https://arxiv.org/abs/1409.3036

zbMATH Keywords

oriented graphpermanental polynomialskew adjacency matrix

Mathematics Subject Classification ID

Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Abstract: Let $G^{s}igma$ be an orientation of a simple graph $G$. In this paper, the permanental polynomial of an oriented graph $G^{s}igma$ is introduced. The coefficients of the permanental polynomial of $G^{s}igma$ are interpreted in terms of the graph structure of $G^{s}igma$, and it is proved that all orientations $G^{s}igma$ of $G$ have the same permanental polynomial if and only if $G$ has no even cycles. Furthermore, the roots of the permanental polynomial of $G^{s}igma$ are studied.

Recommendations

• On the skew-permanental polynomials of orientation graphs
• Characteristic polynomials of skew-adjacency matrices of oriented graphs
• The graphs whose permanental polynomials are symmetric
• On the permanental polynomials of some graphs
• On the matching and permanental polynomials of graphs

Cited in

(6)

• On the permanental polynomials of some graphs
• On the matching and permanental polynomials of graphs
• On the normalized Laplacian permanental polynomial of a graph
• On the skew-permanental polynomials of orientation graphs
• The characteristic polynomial and the matchings polynomial of a weighted oriented graph
• Characteristic polynomials of skew-adjacency matrices of oriented graphs

This page was built for publication: Permanental polynomials of skew adjacency matrices of oriented graphs

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