A note on graphs with purely imaginary per-spectrum

DOI10.1016/J.AMC.2024.128754MaRDI QIDQ6571006zbMATH OpenFDO

Authors Ranveer Singh, Hitesh Wankhede

Publication date 11 July 2024

Published in Applied Mathematics and Computation (Search for Journal in Brave)

zbMATH Keywords

coalescencepermanental polynomialbipartite graphstheta graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Graph polynomials (05C31) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• scientific article; zbMATH DE number 3929044
• A note on the permanental roots of bipartite graphs
• Per-spectral characterizations of graphs with extremal per-nullity
• Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
• Per-spectral characterizations of some bipartite graphs

Cites work

• scientific article; zbMATH DE number 3831985 (Why is no real title available?)
• scientific article; zbMATH DE number 3811615 (Why is no real title available?)
• scientific article; zbMATH DE number 3929044 (Why is no real title available?)
• scientific article; zbMATH DE number 3482387 (Why is no real title available?)
• scientific article; zbMATH DE number 5057518 (Why is no real title available?)
• A full complexity dichotomy for immanant families
• A new graph product and its spectrum
• A note on the permanental roots of bipartite graphs
• An update on a few permanent conjectures
• Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
• Constructing cospectral graphs
• Constructing graphs which are permanental cospectral and adjacency cospectral
• Graphs whose characteristic and permanental polynomials have coefficients of the same magnitude
• Highly unique network descriptors based on the roots of the permanental polynomial
• On the characteristic polynomial of homeomorphic images of a graph
• On the characterizing properties of the permanental polynomials of graphs
• On the matching and permanental polynomials of graphs
• On the permanental polynomials of some graphs
• On the skew-permanental polynomials of orientation graphs
• Recent developments and open problems in the theory of permanents
• Spectra of graphs
• The complexity of computing the permanent
• The graphs whose permanental polynomials are symmetric
• Which graphs are determined by their spectrum?

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: A note on graphs with purely imaginary per-spectrum

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