Apart from hyperovals and their duals there are only three classes of maximal arcs known in Desarguesian projective planes. Two classes are due to J. A. Thas and one to R. H. F. Denniston. In this paper collineation stabiliser and isomorphism problems for those maximal arcs in Desarguesian projective planes are examined. The full collineation stabilisers of the known maximal arcs are calculated...

The travelling salesman problem (TSP) is a whereby finite number of nodes are supposed to be visited exactly once, one after the other, in such way that total weight connecting arcs used visit these minimized. We propose labelling method solve TSP problem. algorithm terminates K−1 iterations, where K network. algorithm’s design allows it determine alternative tours if there any computational co...

It has been recognized that the arc statistics of gravitational lensing is a useful probe of the density profile of clusters of galaxies. We examine several systematic effects which are important in predicting the number of arcs, with particular attention to the difference between tangential and radial arcs. First we derive an analytic expression of the cross section for radial arcs taking acco...

A complementation operation on a vertex of a digraph changes all outgoing arcs into non-arcs, and outgoing non-arcs into arcs. This defines an equivalence relation where two digraphs are equivalent if one can be obtained from the other by a sequence of such operations. We show that given an adjacency-list representation of a digraph G, many fundamental graph algorithms can be carried out on any...

In this paper, we revisit the conjecture of [1], stating that ε-free Petri nets with transfer arcs are strictly more expressive than ε-free Petri nets with reset arcs. In [1], an ε-free Petri net with transfer arcs is provided, whose language is conjectured not to be recognizable by any ε-free Petri net with reset arcs. We show that this latter conjecture is flawed, by exhibiting an ε-free Petr...