The upper bound for the maximal edge number of the graph has been derived, and a few valuable corollaries are also given. 給出圖的最大邊數的上界,并在此基礎上得出了幾個(gè)有用的推論。
The cyclic edge connectivity of a graph is the size of a minimum cyclic edge cutset of a graph. 一個(gè)圖的圈邊連通度是指最小圈邊割的邊數。