the noncommuting graph $nabla (g)$ of a group $g$ is asimple graph whose vertex set is the set of noncentral elements of$g$ and the edges of which are the ones connecting twononcommuting elements. we determine here, up to isomorphism, thestructure of any finite nonabeilan group $g$ whose noncommutinggraph is a split graph, that is, a graph whose vertex set can bepartitioned into two sets such t...

In graph theory, Graph Isomorphism is an important issue. Information in the database can be stored in the form of graph. Graph represents the structural information in an efficient way. Graph Isomorphism problem is to determine if there exists one to one correspondence between the structures of two graphs. Graph isomorphism problem arises in many fields such as chemistry, switching theory, inf...