In this paper, we give a process to enumerate all maximal planar graphs with minimum degree ve, with a xed number of vertices. These graphs are called MPG5 [6]. We have used the algorithm [3] to generate these graphs. For the MPG5 enumeration we have used the general method due to Brenda McKay in [5]; i.e. by computing the orbits set of automorphism group and canonical forms.

this article is a review on occupational therapy in iran. occupational therapy started in the rehabilitation faculty of iran medical university as a bs degree in 1973. about 2000 students were graduated in occupational therapy and are active in different parts of the country. they assist disabled individuals to achieve maximal independence. in this article a summary of the history and education...

This article is a review on occupational therapy in Iran. Occupational therapy started in the Rehabilitation faculty of Iran Medical University as a BS degree in 1973. About 2000 students were graduated in occupational therapy and are active in different parts of the country. They assist disabled individuals to achieve maximal independence. In this article a summary of the history and education...

We give a simple condition for a linear recurrence (mod 2W) of degree r to have the maximal possible period 2M_1(2'' 1). It follows that the period is maximal in the cases of interest for pseudorandom number generation, i.e., for three-term linear recurrences defined by trinomials which are primitive (mod 2) and of degree r > 2 . We consider the enumeration of certain exceptional polynomials wh...

In 1969, Denniston gave a construction of maximal arcs of degree d in Desarguesian projective planes of even order q, for all d dividing q. In 2002 Mathon gave a construction method generalizing the one of Denniston. We will give a new geometric approach to these maximal arcs. This will allow us to count the number of non-isomorphic Mathon maximal arcs of degree 8 in PG(2, 2h), h 6= 7 and prime...

The aim of this paper is to revisit the question local–global principles for embeddings étale algebras with involution into central simple over global fields characteristic not 2. A necessary and sufficient condition given in Bayer-Fluckiger et al. (J Eur Math Soc 20:137–163, 2018). In present paper, we give a simpler description obstruction group. It also shown that if algebra product pairwise...

We study the problem of determining the largest d of a non-Denniston maximal arc of degree 2 generated by a fp; 1g-map in PGð2; 2Þ via a recent construction of Mathon [9]. On one hand, we show that there are fp; 1g-maps that generate non-Denniston maximal arcs of degree 2ðmþ1Þ=2, where md 5 is odd. Together with Mathon’s result [9] in the m even case, this shows that there are always fp; 1g-map...