摘要

This note presents a new upper bound for the complexity of a graph in term of the edge number.