1 paper · 1 filter
Junying Lu, Lu Lu, Yongtao Li
Let Ck△ be the graph obtained from a cycle Ck by adding a new vertex connecting two adjacent vertices in Ck. In this note, we obtain the graph maximizing th…