Generalized Matrix Functions and the Graph Isomorphism Problem

Abstract

Previous article Next article Generalized Matrix Functions and the Graph Isomorphism ProblemJames TurnerJames Turnerhttps://doi.org/10.1137/0116041PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] Frank Harary, The determinant of the adjacency matrix of a graph, SIAM Rev., 4 (1962), 202–210 10.1137/1004057 MR0144330 0113.17406 LinkISIGoogle Scholar[2] Michael E. Fisher, On hearing the shape of a drum, J. Combinatorial Theory, 1 (1966), 105–125 MR0197344 0139.43302 CrossrefGoogle Scholar[3] G. Baker, Drum shapes and isospectral graphs, BNL 10088, Brookhaven National Laboratory, Long Island, New York, 1966 Google Scholar[4] D. Littlewood, The Theory of Group Characters, Oxford University Press, London, 1958 Google Scholar[5] Marvin Marcus and , Henryk Minc, Inequalities for general matrix functions, Bull. Amer. Math. Soc., 70 (1964), 308–313 MR0158896 0122.01607 CrossrefISIGoogle Scholar[6] C. Macduffee, The Theory of Matrices, Springer, Berlin, 1933 0007.19507 CrossrefGoogle Scholar[7] Lothar Collatz and , Ulrich Sinogowitz, Spektren endlicher Grafen, Abh. Math. Sem. Univ. Hamburg, 21 (1957), 63–77 MR0087952 0077.36704 CrossrefGoogle Scholar[8] Claude Berge, The theory of graphs and its applications, Translated by Alison Doig, Methuen & Co. Ltd., London, 1962x+247 MR0132541 0097.38903 Google Scholar Previous article Next article FiguresRelatedReferencesCited byDetails On the matching and permanental polynomials of graphsDiscrete Applied Mathematics, Vol. 302 Cross Ref Graphs determined by the (signless) Laplacian permanental polynomials18 November 2020 | Linear and Multilinear Algebra, Vol. 54 Cross Ref On the Normalized Laplacian Permanental Polynomial of a Graph25 January 2019 | Bulletin of the Iranian Mathematical Society, Vol. 45, No. 5 Cross Ref Constructing Graphs Which are Permanental Cospectral and Adjacency Cospectral12 October 2018 | Graphs and Combinatorics, Vol. 34, No. 6 Cross Ref Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leavesAdvances in Applied Mathematics, Vol. 96 Cross Ref On the permanental nullity and matching number of graphs13 March 2017 | Linear and Multilinear Algebra, Vol. 66, No. 3 Cross Ref Computing the permanental polynomials of graphsApplied Mathematics and Computation, Vol. 304 Cross Ref On the Permanental Polynomials of Graphs28 November 2016 Cross Ref Graphs whose characteristic and permanental polynomials have coefficients of the same magnitudeDiscrete Mathematics, Vol. 339, No. 8 Cross Ref Per-spectral and adjacency spectral characterizations of a complete graph removing six edgesDiscrete Applied Mathematics, Vol. 203 Cross Ref Per-spectral characterizations of some edge-deleted subgraphs of a complete graph14 February 2014 | Linear and Multilinear Algebra, Vol. 63, No. 2 Cross Ref Characterizing properties of permanental polynomials of lollipop graphs27 March 2013 | Linear and Multilinear Algebra, Vol. 62, No. 4 Cross Ref On the characterizing properties of the permanental polynomials of graphsLinear Algebra and its Applications, Vol. 438, No. 1 Cross Ref I Cross Ref Reconstruction of Weighted Graphs by their SpectrumEuropean Journal of Combinatorics, Vol. 21, No. 5 Cross Ref Generation of isospectral graphsJournal of Graph Theory, Vol. 31, No. 3 Cross Ref Selection of best frame, input and output links for function generators modelled as probabilistic systemsMechanism and Machine Theory, Vol. 31, No. 7 Cross Ref Polyhedral object recognition by indexingPattern Recognition, Vol. 28, No. 12 Cross Ref Laplacian matrices of graphs: a surveyLinear Algebra and its Applications, Vol. 197-198 Cross Ref Almost all trees share a complete set of immanantal polynomialsJournal of Graph Theory, Vol. 17, No. 4 Cross Ref Imminant polynomials of graphsTheoretica Chimica Acta, Vol. 85, No. 5 Cross Ref Almost all trees are co-immanantalLinear Algebra and its Applications, Vol. 150 Cross Ref Identification and isomorphism of kinematic chains and mechanismsMechanism and Machine Theory, Vol. 24, No. 4 Cross Ref On The Merits Of Plane Kinematic Chains Modelled As Probabilistic Systems1 September 2016 | International Journal of Modelling and Simulation, Vol. 8, No. 1 Cross Ref Canonical numbering of kinematic chains and isomorphism problem: min codeMechanism and Machine Theory, Vol. 22, No. 5 Cross Ref A New Algorithm for Graph Monomorphism Based on the Projections of the Product GraphIEEE Transactions on Systems, Man, and Cybernetics, Vol. 16, No. 5 Cross Ref The Second Immanantal Polynomial and the Centroid of a GraphRussell Merris17 July 2006 | SIAM Journal on Algebraic Discrete Methods, Vol. 7, No. 3AbstractPDF (1545 KB)Developments in the theory of graph spectra30 May 2007 | Linear and Multilinear Algebra, Vol. 18, No. 2 Cross Ref Report on the Dublin matrix theory conference, March 1984Linear Algebra and its Applications, Vol. 68 Cross Ref Graph isomorphism problemJournal of Soviet Mathematics, Vol. 29, No. 4 Cross Ref Permanental roots and the star degree of a graphLinear Algebra and its Applications, Vol. 64 Cross Ref Efficient graph automorphism by vertex partitioningArtificial Intelligence, Vol. 21, No. 1-2 Cross Ref Relational networks: An extension of sociometric conceptsSocial Networks, Vol. 4, No. 2 Cross Ref Permanental polynomials of graphsLinear Algebra and its Applications, Vol. 38 Cross Ref Initial vertex partitioning and testing isomorphism of graphs and digraphsInternational Journal of Circuit Theory and Applications, Vol. 9, No. 1 Cross Ref A form invariant multivariable polynomial representation of graphs9 October 2006 Cross Ref Refined Vertex Codes and Vertex Partitioning Methodology for Graph Isomorphism TestingIEEE Transactions on Systems, Man, and Cybernetics, Vol. 10, No. 10 Cross Ref Algorithms for finding directed graph isomorphisms by finite automataInternational Journal of Computer & Information Sciences, Vol. 9, No. 2 Cross Ref Graph Monomorphism AlgorithmsIEEE Transactions on Systems, Man, and Cybernetics, Vol. 10, No. 4 Cross Ref The graph isomorphism diseaseJournal of Graph Theory, Vol. 1, No. 4 Cross Ref Literature Cross Ref A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance MatricesJournal of the ACM, Vol. 23, No. 3 Cross Ref A Backtrack Procedure for Isomorphism of Directed GraphsJournal of the ACM, Vol. 20, No. 3 Cross Ref Bibliography Cross Ref Graph theory and molecular orbitals Cross Ref Volume 16, Issue 3| 1968SIAM Journal on Applied Mathematics History Submitted:05 July 1967Published online:12 July 2006 InformationCopyright © 1968 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0116041Article page range:pp. 520-526ISSN (print):0036-1399ISSN (online):1095-712XPublisher:Society for Industrial and Applied Mathematics