In this paper, we have investigated second Hankel determinants and FeketeSzego inequalities for some subclasses of Bi-univalent functions with respect to symmet
A loopless graph on n vertices in which vertices are connected at least by a and at most by b edges is called a(a,b,n)-graph.A(b,b,n)-graph is called(b,n)-graph