The energy of a graph E(G), is the sum of the singular values of its adjacency matrix. We define incidence energy of the graph G, denoted by IE(G), as the sum of the singular values of its incidenceâ€¦ (More)

A graph is hypohamiltonian if it is not Hamiltonian, but the deletion of any single vertex gives a Hamiltonian graph. Until now, the smallest known planar hypohamiltonian graph had 42 vertices, aâ€¦ (More)

In this paper, we introduce the fuzzy Voronoi diagram as an extension of the Voronoi diagram. We assume Voronoi sites to be fuzzy points and then define the Voronoi diagram for this kind of sites,â€¦ (More)