We present mean and non mean graphs of order \(\leq 6\), and give an upper bound for the number of edges of a graph with certain number of vertices to be a mean graph, and we show that the maximum vertex degree could be found in mean graphs depending on the number of edges. Also, we construct families of mean graphs depending on other mean and non mean graphs.
1970-2025 CP (Manitoba, Canada) unless otherwise stated.