Definition
In graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H
Related concepts
Adjacent (graph theory)Analysis of algorithmsArc (graph theory)BijectionCheminformaticsClass (set theory)Colored graphCommunications of the ACMComplete bipartite graphComplete graphComputational complexity theoryComputers and IntractabilityCycle (graph theory)David S. JohnsonDigraph (mathematics)Directed graphElectronic circuitElectronic design automationEquivalence classEquivalence relationFractional graph isomorphismGraph (data structure)Graph (discrete mathematics)Graph automorphismGraph canonizationGraph drawingGraph homomorphismGraph isomorphism problemGraph labelingGraph propertiesGraph theoryHassler WhitneyHypergraphIf and only ifIntegerInteger factorizationInternational Congress of MathematiciansIsomorphismIsomorphism classJournal of Computer and System SciencesLabeled graphLecture Notes in Computer ScienceLine graphLászló BabaiMathematical chemistryMichael GareyNP-completeNP (complexity)P (complexity)P versus NP problemPolynomial hierarchyQuanta MagazineQuasi-polynomial timeRooted treeScience (journal)Sub-exponential timeSubgraph isomorphism problemSymposium on Theory of ComputingW. H. Freeman and CompanyWeighted graphWeisfeiler Leman graph isomorphism testWhitney graph isomorphism theorem
12 concepts already in your glossary