Generalized Matrix Functions and the Graph Isomorphism Problem

Cited in

(27)

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

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)