Let G be a finite group and p (G) be the set of all the prime divisors of |G|. The prime graph of G is a simple graph G (G) whose vertex set is p (G) and two distinct vertices p and q are joined by an edge if and only if G has an element of order pq, and in this case we will write p~q. The degree of p is the number of vertices adjacent to p and is denoted by deg (p). If |G|=p1a1p2a2 … pkak, pi’s different primes, p1<p2<…< pk, then D (G) = (deg (p1), deg (p2), …, deg (pk)) is called the degree pattern of G. A finite group G is called k-fold OD-characterizable if there exist exactly k non-isomorphic groups S with |G|=|S| and D (G) =D (S). In this paper, we characterize groups with the same order and degree pattern as an almost simple groups related to L3 (25).