Abstract

From a set of d-dimensional vectors for some integer d≥1, we obtain a d-dot product graph by letting each vector au correspond to a vertex u and by adding an edge between two vertices u and v if and only if their dot product au⋅av≥t, for some fixed, positive threshold t. Dot product graphs can be used to model social networks. To understand the position of d-dot product graphs in the landscape of graph classes, we consider the case d=2, and investigate how 2-dot product graphs relate to a number of other known graph classes.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call