Login / Signup
Graphs with Bounded Maximum Average Degree and Their Neighbor Sum Distinguishing Total-Choice Numbers.
Patcharapan Jumnongnit
Kittikorn Nakprasit
Published in:
Int. J. Math. Math. Sci. (2017)
Keyphrases
</>
average degree
phase transition
small world networks
random walk
network size
undirected graph
constraint satisfaction
small world
nearest neighbor
neural network
communication cost
adjacency matrix