Let $A$ be the weighted adjacency matrix for an undirected graph with non-negative edge weights. Then $A$ is positive semi-definite.
Does a weighted adjacency matrix exist for one of these graphs that is strictly positive definite? How about if loops(edges from a node to itself) are not allowed?