Login / Signup
A class of inequalities relating degrees of adjacent nodes to the average degree in edge-weighted uniform hypergraphs.
Peter D. Johnson Jr.
R. N. Mohapatra
Published in:
Int. J. Math. Math. Sci. (2005)
Keyphrases
</>
average degree
undirected graph
weighted graph
random walk
phase transition
network size
small world networks
adjacency matrix
planar graphs
shortest path
directed graph
edge weights
network structure
graph theory
minimum cost
facet defining inequalities