Abstract: The problem of counting triangles in graphs has been well studied in the literature. However, all existing algorithms, exact or approximate, spend at least linear time in the size of the ...

A series of molecular defect-free Sierpiński triangle fractals have been constructed on surfaces recently. However, the highest order of the fractals is only 4 because of the limitation of kinetic ...