#forcing_graph
Forcing graph
Class of graphs
In graph theory, a forcing graph is one whose density determines whether a graph sequence is quasi-random. The term was first coined by Chung, Graham, and Wilson in 1989. Forcing graphs play an important role in the study of pseudorandomness in graph sequences.
Sat 8th
Provided by Wikipedia
This keyword could refer to multiple things. Here are some suggestions:
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.