Update README.md

README.md

@@ -11,7 +11,7 @@ This project builds off of previous work published in [[1]](#1) and uses pruned
 Complex networks across many domains (ecological food webs, neural systems, electrical circuits) are made up of statistically significant, subgraphs called network motifs. Network motifs are described by the number of nodes they involve and the nature of the connections in-between the nodes (e.g., directed, or bi-directed). The order of the motif is defined by the number of nodes it involves (i.e. n-order motif involves n+1 nodes). For example, a second-order diverging motif involves 3 nodes: 
 
 <p align="center">
-  <img src="figs/motifs.jpg" width="10%">
+  <img src="figs/motifs.jpg" width="100%">
 </p>
 
 A subgraph must be statistically significant over a randomly connected graph to be considered a network motif of a given network. One metric for determining a subgraph’s statistical significance is its z-score when compared to randomly connected graphs.