On the skew-permanental polynomials of orientation graphs

DOI10.1016/j.dam.2016.03.021zbMath1336.05069OpenAlexW2343535283MaRDI QIDQ284839

Wei Li

Publication date: 18 May 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.03.021

zbMATH Keywords

characteristic polynomialorientation graphskew-permanental polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31)

Related Items (4)

Extremal octagonal chains with respect to the coefficients sum of the permanental polynomial ⋮ Some extremal graphs with respect to permanental sum ⋮ On the matching and permanental polynomials of graphs ⋮ On the normalized Laplacian permanental polynomial of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
• The complexity of computing the permanent
• Characteristic polynomials of skew-adjacency matrices of oriented graphs
• Matching theory
• Permanental polynomials of graphs
• Reducible chains of planar 1-cycle resonant graphs
• Even circuits of prescribed clockwise parity
• A characterization of convertible (0,1)-matrices
• On the permanental polynomials of some graphs
• Permanents, Pfaffian orientations, and even directed circuits
• Per-spectral characterizations of some edge-deleted subgraphs of a complete graph
• Permanental polynomials of skew adjacency matrices of oriented graphs

This page was built for publication: On the skew-permanental polynomials of orientation graphs