46 relations: Analysis of algorithms, Bijection, Cheminformatics, Class (set theory), Complete bipartite graph, Complete graph, Computational complexity theory, Cycle (graph theory), Directed graph, Electronic circuit, Electronic design automation, Equivalence class, Equivalence relation, Glossary of graph theory terms, Graph (abstract data type), Graph (discrete mathematics), Graph automorphism, Graph canonization, Graph coloring, Graph drawing, Graph homomorphism, Graph labeling, Graph property, Graph theory, Hassler Whitney, Hypergraph, If and only if, Integer, Integer factorization, Isomorphism, Isomorphism class, Journal of Computer and System Sciences, László Babai, Lecture Notes in Computer Science, Line graph, Mathematical chemistry, NP (complexity), NP-completeness, P (complexity), P versus NP problem, Polynomial hierarchy, Quanta Magazine, Science (journal), Subgraph isomorphism problem, Time complexity, Tree (graph theory).

## Analysis of algorithms

In computer science, the analysis of algorithms is the determination of the computational complexity of algorithms, that is the amount of time, storage and/or other resources necessary to execute them.

New!!: Graph isomorphism and Analysis of algorithms · See more »

## Bijection

In mathematics, a bijection, bijective function, or one-to-one correspondence is a function between the elements of two sets, where each element of one set is paired with exactly one element of the other set, and each element of the other set is paired with exactly one element of the first set.

New!!: Graph isomorphism and Bijection · See more »

## Cheminformatics

Cheminformatics (also known as chemoinformatics, chemioinformatics and chemical informatics) is the use of computer and informational techniques applied to a range of problems in the field of chemistry.

New!!: Graph isomorphism and Cheminformatics · See more »

## Class (set theory)

In set theory and its applications throughout mathematics, a class is a collection of sets (or sometimes other mathematical objects) that can be unambiguously defined by a property that all its members share.

New!!: Graph isomorphism and Class (set theory) · See more »

## Complete bipartite graph

No description.

New!!: Graph isomorphism and Complete bipartite graph · See more »

## Complete graph

No description.

New!!: Graph isomorphism and Complete graph · See more »

## Computational complexity theory

Computational complexity theory is a branch of the theory of computation in theoretical computer science that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other.

New!!: Graph isomorphism and Computational complexity theory · See more »

## Cycle (graph theory)

In graph theory, a cycle is a path of edges and vertices wherein a vertex is reachable from itself.

New!!: Graph isomorphism and Cycle (graph theory) · See more »

## Directed graph

In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is a set of vertices connected by edges, where the edges have a direction associated with them.

New!!: Graph isomorphism and Directed graph · See more »

## Electronic circuit

An electronic circuit is composed of individual electronic components, such as resistors, transistors, capacitors, inductors and diodes, connected by conductive wires or traces through which electric current can flow.

New!!: Graph isomorphism and Electronic circuit · See more »

## Electronic design automation

Electronic design automation (EDA), also referred to as electronic computer-aided design (ECAD), is a category of software tools for designing electronic systems such as integrated circuits and printed circuit boards.

New!!: Graph isomorphism and Electronic design automation · See more »

## Equivalence class

In mathematics, when the elements of some set S have a notion of equivalence (formalized as an equivalence relation) defined on them, then one may naturally split the set S into equivalence classes.

New!!: Graph isomorphism and Equivalence class · See more »

## Equivalence relation

In mathematics, an equivalence relation is a binary relation that is reflexive, symmetric and transitive.

New!!: Graph isomorphism and Equivalence relation · See more »

## Glossary of graph theory terms

This is a glossary of graph theory terms.

New!!: Graph isomorphism and Glossary of graph theory terms · See more »

## Graph (abstract data type)

In computer science, a graph is an abstract data type that is meant to implement the undirected graph and directed graph concepts from mathematics, specifically the field of graph theory.

New!!: Graph isomorphism and Graph (abstract data type) · See more »

## Graph (discrete mathematics)

In mathematics, and more specifically in graph theory, a graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense "related".

New!!: Graph isomorphism and Graph (discrete mathematics) · See more »

## Graph automorphism

In the mathematical field of graph theory, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itself while preserving the edge–vertex connectivity.

New!!: Graph isomorphism and Graph automorphism · See more »

## Graph canonization

In graph theory, a branch of mathematics, graph canonization is the problem finding a canonical form of a given graph G. A canonical form is a labeled graph Canon(G) that is isomorphic to G, such that every graph that is isomorphic to G has the same canonical form as G. Thus, from a solution to the graph canonization problem, one could also solve the problem of graph isomorphism: to test whether two graphs G and H are isomorphic, compute their canonical forms Canon(G) and Canon(H), and test whether these two canonical forms are identical.

New!!: Graph isomorphism and Graph canonization · See more »

## Graph coloring

In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints.

New!!: Graph isomorphism and Graph coloring · See more »

## Graph drawing

Graph drawing is an area of mathematics and computer science combining methods from geometric graph theory and information visualization to derive two-dimensional depictions of graphs arising from applications such as social network analysis, cartography, linguistics, and bioinformatics.

New!!: Graph isomorphism and Graph drawing · See more »

## Graph homomorphism

In the mathematical field of graph theory, a graph homomorphism is a mapping between two graphs that respects their structure.

New!!: Graph isomorphism and Graph homomorphism · See more »

## Graph labeling

In the mathematical discipline of graph theory, a graph labeling is the assignment of labels, traditionally represented by integers, to the edges or vertices, or both, of a graph.

New!!: Graph isomorphism and Graph labeling · See more »

## Graph property

In graph theory, a graph property or graph invariant is a property of graphs that depends only on the abstract structure, not on graph representations such as particular labellings or drawings of the graph.

New!!: Graph isomorphism and Graph property · See more »

## Graph theory

In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.

New!!: Graph isomorphism and Graph theory · See more »

## Hassler Whitney

Hassler Whitney (March 23, 1907 – May 10, 1989) was an American mathematician.

New!!: Graph isomorphism and Hassler Whitney · See more »

## Hypergraph

In mathematics, a hypergraph is a generalization of a graph in which an edge can join any number of vertices.

New!!: Graph isomorphism and Hypergraph · See more »

## If and only if

In logic and related fields such as mathematics and philosophy, if and only if (shortened iff) is a biconditional logical connective between statements.

New!!: Graph isomorphism and If and only if · See more »

## Integer

An integer (from the Latin ''integer'' meaning "whole")Integer 's first literal meaning in Latin is "untouched", from in ("not") plus tangere ("to touch").

New!!: Graph isomorphism and Integer · See more »

## Integer factorization

In number theory, integer factorization is the decomposition of a composite number into a product of smaller integers.

New!!: Graph isomorphism and Integer factorization · See more »

## Isomorphism

In mathematics, an isomorphism (from the Ancient Greek: ἴσος isos "equal", and μορφή morphe "form" or "shape") is a homomorphism or morphism (i.e. a mathematical mapping) that can be reversed by an inverse morphism.

New!!: Graph isomorphism and Isomorphism · See more »

## Isomorphism class

An isomorphism class is a collection of mathematical objects isomorphic to each other.

New!!: Graph isomorphism and Isomorphism class · See more »

## Journal of Computer and System Sciences

The Journal of Computer and System Sciences (JCSS) is a peer-reviewed scientific journal in the field of computer science.

New!!: Graph isomorphism and Journal of Computer and System Sciences · See more »

## László Babai

László "Laci" Babai (born July 20, 1950 in Budapest) from Babai's web site, retrieved 2016-01-28.

New!!: Graph isomorphism and László Babai · See more »

## Lecture Notes in Computer Science

Springer Lecture Notes in Computer Science (LNCS) is a series of computer science books published by Springer Science+Business Media (formerly Springer-Verlag) since 1973.

New!!: Graph isomorphism and Lecture Notes in Computer Science · See more »

## Line graph

In the mathematical discipline of graph theory, the line graph of an undirected graph G is another graph L(G) that represents the adjacencies between edges of G. The name line graph comes from a paper by although both and used the construction before this.

New!!: Graph isomorphism and Line graph · See more »

## Mathematical chemistry

Mathematical chemistry is the area of research engaged in novel applications of mathematics to chemistry; it concerns itself principally with the mathematical modeling of chemical phenomena.

New!!: Graph isomorphism and Mathematical chemistry · See more »

## NP (complexity)

In computational complexity theory, NP (for nondeterministic polynomial time) is a complexity class used to describe certain types of decision problems.

New!!: Graph isomorphism and NP (complexity) · See more »

## NP-completeness

In computational complexity theory, an NP-complete decision problem is one belonging to both the NP and the NP-hard complexity classes.

New!!: Graph isomorphism and NP-completeness · See more »

## P (complexity)

In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is a fundamental complexity class.

New!!: Graph isomorphism and P (complexity) · See more »

## P versus NP problem

The P versus NP problem is a major unsolved problem in computer science.

New!!: Graph isomorphism and P versus NP problem · See more »

## Polynomial hierarchy

In computational complexity theory, the polynomial hierarchy (sometimes called the polynomial-time hierarchy) is a hierarchy of complexity classes that generalize the classes P, NP and co-NP to oracle machines.

New!!: Graph isomorphism and Polynomial hierarchy · See more »

## Quanta Magazine

Quanta Magazine is an editorially independent online publication of the Simons Foundation covering developments in mathematics, theoretical physics, theoretical computer science and the basic life sciences.

New!!: Graph isomorphism and Quanta Magazine · See more »

## Science (journal)

Science, also widely referred to as Science Magazine, is the peer-reviewed academic journal of the American Association for the Advancement of Science (AAAS) and one of the world's top academic journals.

New!!: Graph isomorphism and Science (journal) · See more »

## Subgraph isomorphism problem

In theoretical computer science, the subgraph isomorphism problem is a computational task in which two graphs G and H are given as input, and one must determine whether G contains a subgraph that is isomorphic to H. Subgraph isomorphism is a generalization of both the maximum clique problem and the problem of testing whether a graph contains a Hamiltonian cycle, and is therefore NP-complete.

New!!: Graph isomorphism and Subgraph isomorphism problem · See more »

## Time complexity

In computer science, the time complexity is the computational complexity that describes the amount of time it takes to run an algorithm.

New!!: Graph isomorphism and Time complexity · See more »

## Tree (graph theory)

In mathematics, and more specifically in graph theory, a tree is an undirected graph in which any two vertices are connected by exactly one path.

New!!: Graph isomorphism and Tree (graph theory) · See more »

## Redirects here:

Graph nonisomorphism problem, Isomorphic graph, Isomorphic graphs, Non-isomorphic graphs, Nonisomorphism problem.

## References

[1] https://en.wikipedia.org/wiki/Graph_isomorphism