In this study, we introduce a Graph network-enhanced Finite Element approach to accelerate simulations. We utilize the discretized geometry from pre-processor establish graph and use Neural Network solve boundary value problem of domain. The advantage neural networks is that they have similar structure as compared domain with nodes elements. underlying dynamics system are computed via learned m...

The power graph P(G) of a group G is with vertex set G, where two vertices u and v are adjacent if only u≠v um=v or vm=u for some positive integer m. In this paper, we raise study the following question: For which natural numbers n every groups order isomorphic graphs isomorphic? particular, it proved that all such odd number cube-free also they not multiples 16 in general. Moreover, show finit...

Let R be a finite ring and r∈R. The r-noncommuting graph of R, denoted by ΓRr, is simple undirected whose vertex set two vertices x y are adjacent if only [x,y]≠r [x,y]≠−r. In this paper, we obtain expressions for degrees show that ΓRr neither regular nor lollipop noncommutative. We characterize noncommutative rings such tree, in particular star graph. It also shown ΓR1r ΓR2ψ(r) isomorphic R1 R...