Hi, sorry if this question belongs in 馃敀[private feed], but I was wondering how common it is for graph DBs to include sub-structures that aren't graphical? For example, a social graph which also includes underlying tree structures that represents a family of people.
This is common. The thing is, other structures may be and are often represented as a low level as graphs (a set of nodes and directed edges). For example, taxonomies are hierarchical trees, but they are commonly represented as graphs (for example, a taxonomy may be represented using the SKOS vocabulary for RDF graphs). A tree may be thought of as a directed graph where nodes have at most one outgoing edge ("parent"). A list may be thought of as a directed graph where nodes have at most one incoming edge and at most one outgoing edge. So, graph representation may be a "universal solvent" for all data structures of interest to you.
Everything is a graph. Everything can be represented as triples. As unary and binary relations. The question turns into how you want to model it.