Geometric intersection graphs form an intriguing class of structures in which vertices represent geometric objects – such as line segments, discs, or curves – and an edge is established between two ...

Abstract.For two vertices 𝑢 and 𝑣 of a graph 𝐺, the set 𝐼[𝑢, 𝑣] consists of all vertices lying on some 𝑢 - 𝑣 geodesic in 𝐺. If 𝑆 is a set of vertices of 𝐺, then 𝐼[𝑆] is the union of all ...

This is a preview. Log in through your library . Abstract In this paper, we study the problem of determining the largest number of maximum independent sets of a graph of order n. Solutions to this ...