Multicellular organisms undergo a complex developmental process, orchestrated by the genetic information in their cells, in order to form a newborn individual from a fertilized egg. This complex process, not completely understood yet, is believed to have a key role in generating the impressive biotic diversity of organisms found on earth. Inspired by mechanisms of Eukaryotic genetic expression,...

Simulators in power electronics are less developed than in other electronic fields. The main modelling methods are between the numerical simulation of semiconductor device equations that hardly simulate circuits, and equivalent circuit models that show poor accuracy. We propose the application of the bond graph techniques to model modular power semiconductor devices. Furthermore, the IGBT is a ...

Abstract The prediction of dynamical stability power grids becomes more important and challenging with increasing shares renewable energy sources due to their decentralized structure, reduced inertia volatility. We investigate the feasibility applying graph neural networks (GNN) predict dynamic synchronisation in complex using single-node basin (SNBS) as a measure. To do so, we generate two syn...

This paper deals with the classification of groups G such that power graphs and proper are line graphs. In fact, we classify all finite nilpotent whose Also, categorize (except non-abelian 2-groups) Moreover, investigate when generalized quaternion Besides, derive a condition on order dihedral for which

Let G be a simple graph. For any k ∈ N , the k−power of G is a simple graph G with vertex set V (G) and edge set {xy : dG(x, y) ≤ k} and the k−subdivision of G is a simple graph G 1 k , which is constructed by replacing each edge of G with a path of length k. So we can introduce the m−power of the n−subdivision of G, as a fractional power of G, that is denoted by G m n . In other words G m

For any k ∈ N, the k−subdivision of graph G is a simple graph G 1 k , which is constructed by replacing each edge of G with a path of length k. In this paper we introduce the mth power of the n−subdivision of G, as a fractional power of G, denoted by G m n . In this regard, we investigate chromatic number and clique number of fractional power of graphs. Also, we conjecture that χ(G m n ) = ω(G ...

We show that almost every Cayley graph Γ of an abelian group G of odd prime-power order has automorphism group as small as possible. Additionally, we show that almost every Cayley (di)graph Γ of an abelian group G of odd prime-power order that does not have automorphism group as small as possible is a normal Cayley (di)graph of G (that is, GL/Aut(Γ)).

Graph ranking algorithms such as PageRank and HITS share the common idea of calculating eigenvectors of graph adjacency matrices. This paper shows that the power method usually used to calculate eigenvectors is also present in a spreading activation search. In addition, we empirically show that spreading activation algorithm is able to converge on periodic graphs, where power method fails. Furt...