Constructing graphs which are permanental cospectral and adjacency cospectral
type: Item
instance of: scholarly article
title: Constructing graphs which are permanental cospectral and adjacency cospectral
zbMATH Open document ID: 1402.05143
author: Tingzeng Wu
author: Hong-Jian Lai
published in: Graphs and Combinatorics
publication date: 2019-01-11T00:00:00Z
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C76
Mathematics Subject Classification ID: 05C31
Mathematics Subject Classification ID: 15A15
zbMATH DE Number: 7000718
zbMATH Keywords: permanental polynomial
zbMATH Keywords: characteristic polynomial
zbMATH Keywords: permanental cospectral
zbMATH Keywords: adjacency cospectral
MaRDI profile type: Publication
full work available at URL: s00373-018-1963-z
OpenAlex ID: W2896501955
cites work: Q5396536
cites work: Q3703924
cites work: Q3039393
cites work: Q3659816
cites work: Eigenschaften der Permanentefunktion
cites work: Q4830188
cites work: Q4903435
cites work: Q3907599
cites work: Q3137758
cites work: Q4800134
cites work: An efficient algorithm for computing permanental polynomials of graphs
cites work: Q3643746
cites work: On the characterizing properties of the permanental polynomials of graphs
cites work: Characterizing properties of permanental polynomials of lollipop graphs
cites work: Matching theory
cites work: Two problems involving Schur functions
cites work: Permanental polynomials of graphs
cites work: On the Multiplicative Inverse Eigenvalue Problem
cites work: Graph polynomials
cites work: Generalized Matrix Functions and the Graph Isomorphism Problem
cites work: The complexity of computing the permanent
cites work: Per-spectral characterizations of graphs with extremal per-nullity
cites work: Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
cites work: Per-spectral characterizations of some bipartite graphs
cites work: On the permanental nullity and matching number of graphs
cites work: On the permanental polynomials of some graphs
cites work: Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
cites work: A note on the permanental roots of bipartite graphs
cites work: Per-spectral characterizations of some edge-deleted subgraphs of a complete graph
Wikidata QID: Q129091571
DOI: 10.1007/S00373-018-1963-Z
description: scientific article; zbMATH DE number 7000718