From 70447571616b812358a2b81be1b21ec3ddfc58b9 Mon Sep 17 00:00:00 2001 From: Owen Troke-Billard Date: Tue, 17 Sep 2024 15:25:10 -0600 Subject: [PATCH] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 556ef2c..95a2e47 100644 --- a/README.md +++ b/README.md @@ -38,7 +38,7 @@ Subgraph matching is the task of finding instances of a query graph within a lar searching for patterns in a graph structure, such as relationships within a social network. It is a fundamental problem in graph theory with applications in pattern recognition, databases, security, and biochemistry. -# What is subgraph isomorphism? +# What is a subgraph isomorphism? A graph is a structure consisting of a set of objects where some pairs of objects are connected. A graph isomorphism is a one-to-one correspondence between two graphs such that objects connected in one are also connected in the other.