Searching for the terms examples of misleading graphs or deceptive graphs is rarely the best way to find examples. A better way is to become familiar with graphical problems that cause a figure to ...

For graphs with 20 nodes, we focused on the worst cases for D, k -regular connected graphs with degrees varying from 2 to 11. Finally, we also generate all non-isomorphic trees with 20 and 21 nodes.

The size of the smallest edge cut-set (cohesion) and the size of the smallest node cut-set (connectivity) have been used by some authors as vulnerability measures of a graph. Generalizations of the ...