In this article, we obtain two new characterizations of circulararc bigraphs. One of them is the representation of a circular-arc bigraph in terms of two two-clique circular-arc graphs while another one represents the same as a union of an interval bigraph and a Ferrers bigraph. Finally, we introduce the notions of proper and unit circular-arc bigraphs, characterize them and show that, as in the case of circular-arc graphs, unit circular-arc Journal of Graph Theory

No abstract

No abstract

No abstract

Voronoi game is a geometric model of competitive facility location problem played between two players. Users are generally modeled as points uniformly distributed on a given underlying space. Each player chooses a set of points in the underlying space to place their facilities. Each user avails service from its nearest facility. Service zone of a facility consists of the set of users which are closer to it than any other facility. Payoff of each player is defined by the quantity of users served by all of its facilities. The objective of each player is to maximize their respective payoff. In this paper we consider the two players Voronoi game where the underlying space is a road network modeled by a graph. In this framework we consider the problem of finding k optimal facility locations of Player 2 given any placement of m facilities by Player 1. Our main result is a dynamic programming based polynomial time algorithm for this problem on tree network. On the other hand, we show that the problem is strongly N P-complete for graphs. This proves that finding a winning strategy of P2 is N P-complete. Consequently, we design an 1 − 1 e factor approximation algorithm, where e ≈ 2.718.