Generalized Matrix Functions and the Graph Isomorphism Problem

From MaRDI portal
Publication:5578301

DOI10.1137/0116041zbMath0185.51701OpenAlexW2025412342MaRDI QIDQ5578301

James Turner

Publication date: 1968

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0116041




Related Items (26)

Graphs whose characteristic and permanental polynomials have coefficients of the same magnitudeGraphs determined by the (signless) Laplacian permanental polynomialsThe Second Immanantal Polynomial and the Centroid of a GraphPer-spectral characterizations of some edge-deleted subgraphs of a complete graphRecovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leavesOn the characterizing properties of the permanental polynomials of graphsOn the roots of (signless) Laplacian permanental polynomials of graphsA study on determination of some graphs by Laplacian and signless Laplacian permanental polynomialsThe graphs whose permanental polynomials are symmetricPermanental polynomials of graphsA note on the permanental roots of bipartite graphsComputing the permanental polynomials of graphsConstructing graphs which are permanental cospectral and adjacency cospectralAlgorithms for finding directed graph isomorphisms by finite automataOn the permanental nullity and matching number of graphsOn the matching and permanental polynomials of graphsAlmost all trees are co-immanantalDevelopments in the theory of graph spectraCharacterizing properties of permanental polynomials of lollipop graphsEfficient graph automorphism by vertex partitioningReconstruction of weighted graphs by their spectrumOn the normalized Laplacian permanental polynomial of a graphGraph isomorphism problemPermanental roots and the star degree of a graphLaplacian matrices of graphs: A surveyPer-spectral and adjacency spectral characterizations of a complete graph removing six edges




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