its is a type of math graph in which most nodes are not nei…

its is a type of math graph in which most nodes are not neighbors of one another, but the neighbors of any given node are likely to be neighbors of each other & most nodes can be reached frm every other node by a small number of hops/steps

@341 @82 @2459