The star number of a graph $G$, is the smallest $k$ for which $G$ is a star-$k$-PCG. In this paper, we study the effects of various graph operations, such as the addition of twins, pendant vertices, universal vertices, or isolated vertices, on the star number of the graph ...
The paper has made an attempt to formalise the Wavelet Transform for Parallel Processing Environment. In this paper, the flow graph of the Wavelet Transform has been analysed and modelled on Star Graph Architecture. The decomposition and ordering has been computed for efficient execution of the ...
1.3 truncated coherent states on the star-graph in general, there is no natural definition of a coherent state on a star-graph, neither there is a unique way to extend coherent states through the vertex. since we are interested in initial states concentrated on one edge of the graph, we i...
Then, a star topology convolution (STC) can be introduced for graph representation learning to perform the spectral convolution on these subgraphs to obtain the spectral node embedding. These can be aggregated to the central node of each subgraph. Hence, this method can create localized filters in...
In this paper, we study the total edge irregularity strength of some well known graphs. An edge irregular total $k$-labeling $varphi: Vcup E o { 1,2, dots, k }$ of a~graph $G=(V,E)$ is a~labeling of vertices and edges of $G$ in such a~way that for any different edges $...
The alternating group network ANn(n≥3), proposed by Ji [5], is a Cayley graph on the alternating group An with respect to the generating set S={(123),(132),(12)(3i):4≤i≤n}. Cheng et al. [2] proved that ANn≅Sn,n−2. When h∈{0,1,2}, κs(h)(ANn) and λs(...
Let G be a refinement of a star graph with center c. Let Gc∗ be the subgraph of G induced on the vertex set V(G)∖{c or end vertices adjacent to c}. In this paper, we completely determine the structure of commutative zero-divisor semigroups S whose zero-divisor graph G=Γ(S...
Reliability Modeling and Assessment of the Star-Graph Networks. Examines the reliability of the Star Graph architecture. Robustness of the star graph network; Degradation of the Star Graph into Substar graphs to measure... Fitzgerald,Kent,Latifi,... - 《IEEE Transactions on Reliability》 被引量:...
The Deadlock-free Routing Restrictions and Deadlock-free Routing Algorithms on Star Graph; 星形图上无死锁受限条件及路由算法2. This paper studies the deadlock -frec behavior of routing algorithms on the star graphs. 本文对星形图上路径算法的无死锁性问题进行了分析,给出了星形图上的两个无死锁受...
We study standing waves for a nonlinear Schrödinger equation on a star graph G , i.e. N halflines joined at a vertex. At the vertex an interaction occurs described by a boundary condition of delta type with strength α ⩽ 0 . The nonlinearity is of focusing power type. The dynamics...