Binod Kumar Sahoo

Algebraic Connectivity of Connected Graphs with Fixed Number of Pendant Vertices

In this paper, we consider the following problem. Over the class of all simple connected graphs of order n with k pendant vertices (n, k being fixed), which graph maximizes (respectively, minimizes) the algebraic connectivity? We also discuss the algebraic connectivity of unicyclic graphs.

A characterization of finite symplectic polar spaces of odd prime order

A sufficient condition for the representation group for a nonabelian representation (Definition 1.1) of a finite partial linear space to be a finite p-group is given (Theorem 2.9). We characterize finite symplectic polar spaces of rank r at least two and of odd prime order p as the only finite polar spaces of rank at least two and of prime order admitting nonabelian representations. The representation group of such a polar space is an extraspecial p-group of order p^1^+^2^r and of exponent p (Theorems 1.5 and 1.6).

Binary codes of the symplectic generalized quadrangle of even order

Let

Minimum size blocking sets of certain line sets related to a conic in P G ( 2 , q )

q

Non-abelian representations of the slim dense near hexagons on 81 and 243 points

q be a prime power and

Note: New constructions of two slim dense near hexagons

W(q)