diff --git a/README.md b/README.md
index f08b0e1..80f4a88 100644
--- a/README.md
+++ b/README.md
@@ -25,7 +25,7 @@ julia> ] add NamedGraphs
 
 
 
-This packages introduces graph types with named edges, which are built on top of the `Graph`/`SimpleGraph` type in the [Graphs.jl](https://github.com/JuliaGraphs/Graphs.jl) package that only have contiguous integer edges (i.e. linear indexing).
+This packages introduces graph types with named vertices, which are built on top of the `Graph`/`SimpleGraph` type in the [Graphs.jl](https://github.com/JuliaGraphs/Graphs.jl) package that only have contiguous integer vertices (i.e. linear indexing). The vertex names can be strings, tuples of integers, or other unique identifiers (anything that is hashable).
 
 
 
diff --git a/examples/README.jl b/examples/README.jl
index a0a7596..b9e49ae 100644
--- a/examples/README.jl
+++ b/examples/README.jl
@@ -15,7 +15,7 @@
 
 #' ## Introduction
 
-#' This packages introduces graph types with named edges, which are built on top of the `Graph`/`SimpleGraph` type in the [Graphs.jl](https://github.com/JuliaGraphs/Graphs.jl) package that only have contiguous integer edges (i.e. linear indexing).
+#' This packages introduces graph types with named vertices, which are built on top of the `Graph`/`SimpleGraph` type in the [Graphs.jl](https://github.com/JuliaGraphs/Graphs.jl) package that only have contiguous integer vertices (i.e. linear indexing). The vertex names can be strings, tuples of integers, or other unique identifiers (anything that is hashable).
 
 #' There is a supertype `AbstractNamedGraph` that defines an interface and fallback implementations of standard
 #' Graphs.jl operations, and two implementations: `NamedGraph` and `NamedDiGraph`.