Minimizing graph of the connected graphs whose complements are bicyclic with two cycles

A connected graph containing two or three cycles is called a bicyclic graph if its number of edges is equal to its number of vertices plus one. In this paper, we characterize the minimizing graph among all the connected graphs that belong to a class of graphs whose complements are bicyclic with two cycles.
Nội dung trích xuất từ tài liệu:
Minimizing graph of the connected graphs whose complements are bicyclic with two cycles