Subdivisions of a Graph of Maximal Degree n + 1 in Graphs of Average Degree n\epsilon and Large Girth.

Published in: Comb. (2001)

Keyphrases

average degree
phase transition
small world networks
random walk
network size
undirected graph
clustering coefficient
random graphs
adjacency matrix
small world
constraint satisfaction
independent set
social networks
degree distribution
neural network
scale free
graph representation
weighted graph
graph theory