‎For a finite group $G$‎, ‎let $nse(G)={m_kmid kinpi_e(G)}$‎, ‎where $m_k$ is the number of elements of order $k$ in $G$‎ ‎and $pi_{e}(G)$ is the set of element orders of $G$‎. ‎In this paper‎, ‎we prove that $Gcong L_m(2)$ if and only if $pmid |G|$ and $nse(G)=nse(L_m(2))$‎, ‎where $min {n,n+1}$ and $2^n-1=p$ is a prime number.

In this paper we provide explicit formulas for the number of elements/subgroups/cyclic subgroups of a given order and for the total number of subgroups/cyclic subgroups in a finite Hamiltonian group. The coverings with three proper subgroups and the principal series of such a group are also counted. Finally, we give a complete description of the lattice of characteristic subgroups of a finite H...

An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...