Generalized Matrix Functions and the Graph Isomorphism Problem

Cited in

(27)

On the permanental nullity and matching number of graphs
Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
On the second immanantal polynomials of graphs
Characterizing properties of permanental polynomials of lollipop graphs
Computing the permanental polynomials of graphs
Graphs whose characteristic and permanental polynomials have coefficients of the same magnitude
A note on the permanental roots of bipartite graphs
The Second Immanantal Polynomial and the Centroid of a Graph
Reconstruction of weighted graphs by their spectrum
Permanental polynomials of graphs
Laplacian matrices of graphs: A survey
Permanental roots and the star degree of a graph
Algorithms for finding directed graph isomorphisms by finite automata
Constructing graphs which are permanental cospectral and adjacency cospectral
On the characterizing properties of the permanental polynomials of graphs
Graphs determined by the (signless) Laplacian permanental polynomials
On the matching and permanental polynomials of graphs
Almost all trees are co-immanantal
Per-spectral characterizations of some edge-deleted subgraphs of a complete graph
Efficient graph automorphism by vertex partitioning
On the normalized Laplacian permanental polynomial of a graph
The graphs whose permanental polynomials are symmetric
Developments in the theory of graph spectra
Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves
Graph isomorphism problem
On the roots of (signless) Laplacian permanental polynomials of graphs
A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials

This page was built for publication: Generalized Matrix Functions and the Graph Isomorphism Problem

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