Login / Signup
Bounds on the index of the Signless Laplacian of a graph involving the average degree of neighbors of a vertex.
Nair Maria Maia de Abreu
Pierre Hansen
Carla Silva Oliveira
Leonardo Silva de Lima
Published in:
CTW (2007)
Keyphrases
</>
average degree
phase transition
random walk
network size
small world networks
undirected graph
nearest neighbor
upper bound
neural network
lower bound
adjacency matrix
index structure
directed graph
markov chain
approximation algorithms
network topology
np complete
knn
computational complexity