Diagnosability of Bubble-Sort Star Graphs with Missing Edges

2019 ◽  
Vol 19 (02) ◽  
pp. 1950002 ◽  
Author(s):  
SHIYING WANG ◽  
YINGYING WANG
Keyword(s):  
Multiprocessor System ◽  
Star Graph ◽  
Star Graphs ◽  
Comparison Model ◽  
Model Following ◽  
Strong Property

The diagnosability of a multiprocessor system plays an important role. The bubble-sort star graph BSn has many good properties. In this paper, we study the diagnosis on BSn under the comparison model. Following the concept of the local diagnosability, the strong local diagnosability property is discussed. This property describes the equivalence of the local diagnosability of a node and its degree. We prove that BSn (n ≥ 5) has this property, and it keeps this strong property even if there exist (2n − 5) missing edges in it, and the result is optimal with respect to the number of missing edges.

CONDITIONAL DIAGNOSABILITY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITION TREES UNDER THE COMPARISON DIAGNOSIS MODEL

2008 ◽  
Vol 09 (01n02) ◽  
pp. 83-97 ◽  
Author(s):  
CHENG-KUAN LIN ◽  
JIMMY J. M. TAN ◽  
LIH-HSING HSU ◽  
EDDIE CHENG ◽  
LÁSZLÓ LIPTÁK
Keyword(s):  
Cayley Graphs ◽  
Multiprocessor Systems ◽  
Star Graph ◽  
Reliable Computing ◽  
Star Graphs ◽  
Comparison Model ◽  
Diagnosis Model ◽  
Conditional Diagnosability

The diagnosis of faulty processors plays an important role in multiprocessor systems for reliable computing, and the diagnosability of many well-known networks has been explored. Zheng et al. showed that the diagnosability of the n-dimensional star graph Sn is n - 1. Lai et al. introduced a restricted diagnosability of multiprocessor systems called conditional diagnosability. They consider the situation when no faulty set can contain all the neighbors of any vertex in the system. In this paper, we study the conditional diagnosability of Cayley graphs generated by transposition trees (which include the star graphs) under the comparison model, and show that it is 3n - 8 for n ≥ 4, except for the n-dimensional star graph, for which it is 3n - 7. Hence the conditional diagnosability of these graphs is about three times larger than their classical diagnosability.

A Note of Independent Number and Domination Number of Qn,k,m-Graph

2019 ◽  
Vol 29 (03) ◽  
pp. 1950011
Author(s):  
Jiafei Liu ◽  
Shuming Zhou ◽  
Zhendong Gu ◽  
Yihong Wang ◽  
Qianru Zhou
Keyword(s):  
Interconnection Networks ◽  
Interconnection Network ◽  
Domination Number ◽  
Multiprocessor System ◽  
Star Graph ◽  
Minimum Cardinality ◽  
Arrangement Graph ◽  
Independent Number ◽  
Potential Applications ◽  
By Products

The independent number and domination number are two essential parameters to assess the resilience of the interconnection network of multiprocessor systems which is usually modeled by a graph. The independent number, denoted by [Formula: see text], of a graph [Formula: see text] is the maximum cardinality of any subset [Formula: see text] such that no two elements in [Formula: see text] are adjacent in [Formula: see text]. The domination number, denoted by [Formula: see text], of a graph [Formula: see text] is the minimum cardinality of any subset [Formula: see text] such that every vertex in [Formula: see text] is either in [Formula: see text] or adjacent to an element of [Formula: see text]. But so far, determining the independent number and domination number of a graph is still an NPC problem. Therefore, it is of utmost importance to determine the number of independent and domination number of some special networks with potential applications in multiprocessor system. In this paper, we firstly resolve the exact values of independent number and upper and lower bound of domination number of the [Formula: see text]-graph, a common generalization of various popular interconnection networks. Besides, as by-products, we derive the independent number and domination number of [Formula: see text]-star graph [Formula: see text], [Formula: see text]-arrangement graph [Formula: see text], as well as three special graphs.

scholarly journals On the Nodal Structure of Nonlinear Stationary Waves on Star Graphs

Symmetry ◽  
2019 ◽  
Vol 11 (2) ◽  
pp. 185
Author(s):  
Ram Band ◽  
Sven Gnutzmann ◽  
August Krueger
Keyword(s):  
Existence Of Solutions ◽  
Stationary Waves ◽  
Star Graph ◽  
Oscillation Theorem ◽  
Nodal Domains ◽  
Nodal Structure ◽  
Star Graphs ◽  
Spectral Curves ◽  
Nonlinear Quantum ◽  
Cubic Nonlinear Schrödinger Equation

We consider stationary waves on nonlinear quantum star graphs, i.e., solutions to the stationary (cubic) nonlinear Schrödinger equation on a metric star graph with Kirchhoff matching conditions at the centre. We prove the existence of solutions that vanish at the centre of the star and classify them according to the nodal structure on each edge (i.e., the number of nodal domains or nodal points that the solution has on each edge). We discuss the relevance of these solutions in more applied settings as starting points for numerical calculations of spectral curves and put our results into the wider context of nodal counting, such as the classic Sturm oscillation theorem.

CONDITIONAL FAULT DIAGNOSABILITY OF DUAL-CUBES

2012 ◽  
Vol 23 (08) ◽  
pp. 1729-1747 ◽  
Author(s):  
SHUMING ZHOU ◽  
LANXIANG CHEN ◽  
JUN-MING XU
Keyword(s):  
Fault Diagnosis ◽  
High Reliability ◽  
Multiprocessor System ◽  
Connected Component ◽  
Comparison Model ◽  
Conditional Diagnosability ◽  
Almost All ◽  
Component Failures ◽  
Fault Diagnosability

The growing size of the multiprocessor system increases its vulnerability to component failures. It is crucial to locate and replace the faulty processors to maintain a system's high reliability. The fault diagnosis is the process of identifying faulty processors in a system through testing. This paper shows that the largest connected component of the survival graph contains almost all of the remaining vertices in the dual-cube DCn when the number of faulty vertices is up to twice or three times of the traditional connectivity. Based on this fault resiliency, this paper determines that the conditional diagnosability of DCn (n ≥ 3) under the comparison model is 3n − 2, which is about three times of the traditional diagnosability.

EMBEDDING OF CYCLES AND GRIDS IN STAR GRAPHS

1991 ◽  
Vol 01 (01) ◽  
pp. 43-74 ◽  
Author(s):  
JUNG-SING JWO ◽  
S. LAKSHMIVARAHAN ◽  
S. K. DHALL
Keyword(s):  
Hamiltonian Cycle ◽  
Parallel Computers ◽  
Star Graph ◽  
Attractive Feature ◽  
Star Graphs ◽  
New Class ◽  
Number Of Authors

The use of the star graph as a viable interconnection scheme for parallel computers has been examined by a number of authors in recent times. An attractive feature of this class of graphs is that it has sublogarithmic diameter and has a great deal of symmetry akin to the binary hypercube. In this paper we describe a new class of algorithms for embedding (a) Hamiltonian cycle (b) the set of all even cycles and (c) a variety of two- and multi-dimensional grids in a star graph. In addition, we also derive an algorithm for the ranking and the unranking problem with respect to the Hamiltonian cycle.

scholarly journals Forcing operators on star graphs applied for the cubic fourth order Schrödinger equation

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Roberto de A. Capistrano–Filho ◽  
Márcio Cavalcante ◽  
Fernando A. Gallego
Keyword(s):  
Schrödinger Equation ◽  
Fourth Order ◽  
Schrodinger Equation ◽  
Initial Boundary ◽  
Common Vertex ◽  
Star Graph ◽  
Star Graphs ◽  
Low Regularity ◽  
Fourier Restriction ◽  
Starting Point

<p style='text-indent:20px;'>In a recent article [<xref ref-type="bibr" rid="b16">16</xref>], the authors gave a starting point of the study on a series of problems concerning the initial boundary value problem and control theory of Biharmonic NLS in some non-standard domains. In this direction, this article deals to present answers for some questions left in [<xref ref-type="bibr" rid="b16">16</xref>] concerning the study of the cubic fourth order Schrödinger equation in a star graph structure <inline-formula><tex-math id="M1">\begin{document}$ \mathcal{G} $\end{document}</tex-math></inline-formula>. Precisely, consider <inline-formula><tex-math id="M2">\begin{document}$ \mathcal{G} $\end{document}</tex-math></inline-formula> composed by <inline-formula><tex-math id="M3">\begin{document}$ N $\end{document}</tex-math></inline-formula> edges parameterized by half-lines <inline-formula><tex-math id="M4">\begin{document}$ (0,+\infty) $\end{document}</tex-math></inline-formula> attached with a common vertex <inline-formula><tex-math id="M5">\begin{document}$ \nu $\end{document}</tex-math></inline-formula>. With this structure the manuscript proposes to study the well-posedness of a dispersive model on star graphs with three appropriated vertex conditions by using the <i>boundary forcing operator approach</i>. More precisely, we give positive answer for the Cauchy problem in low regularity Sobolev spaces. We have noted that this approach seems very efficient, since this allows to use the tools of Harmonic Analysis, for instance, the Fourier restriction method, introduced by Bourgain, while for the other known standard methods to solve partial differential partial equations on star graphs are more complicated to capture the dispersive smoothing effect in low regularity. The arguments presented in this work have prospects to be applied for other nonlinear dispersive equations in the context of star graphs with unbounded edges.</p>

THE PERMUTATIONAL GRAPH: A NEW NETWORK TOPOLOGY

1998 ◽  
Vol 09 (01) ◽  
pp. 3-11
Author(s):  
SATOSHI OKAWA
Keyword(s):  
Network Topology ◽  
Equivalence Classes ◽  
Star Graph ◽  
Complete Graphs ◽  
Graph Topology ◽  
Star Graphs ◽  
Network Topologies ◽  
Graph Families ◽  
The Relationship ◽  
Better Than

This paper introduces the penmutational graph, a new network topology, which preserves the same desirable properties as those of a star graph topology. A permutational graph can be decomposed into subgraphs induced by node sets defined by equivalence classes. Using this decomposition, its structual properties as well as the relationship among graph families, permutational graphs, star graphs, and complete graphs are studied. Moreover, the diameters of permutational graphs are investigated and good estimates are obtained which are better than those of some network topologies of similar orders.

Optimal Neighborhood Broadcast in Star Graphs

2003 ◽  
Vol 04 (04) ◽  
pp. 419-428 ◽  
Author(s):  
Satoshi Fujita
Keyword(s):  
Interconnection Networks ◽  
Completion Time ◽  
Single Port ◽  
Multicast Tree ◽  
Communication Model ◽  
Star Graph ◽  
Star Graphs ◽  
Multicast Trees ◽  
Multicast Scheme ◽  
Special Case

In this paper, we consider the problem of constructing a multicast tree in star interconnection networks under the single-port communication model. Unlike previous schemes for constructing space-efficient multicast trees, we adopt the completion time of each multicast as the objective function to be minimized. In particular, we study a special case of the problem in which all destination vertices are immediate neighbors of the source vertex, and propose a multicast scheme of [Formula: see text] time units for the star graph of dimension n.

scholarly journals Optimal Bounds for Disjoint Hamilton Cycles in Star Graphs

2018 ◽  
Vol 29 (03) ◽  
pp. 377-389 ◽  
Author(s):  
Parisa Derakhshan ◽  
Walter Hussak
Keyword(s):  
Interconnection Network ◽  
Multiple Edge ◽  
Star Graph ◽  
Hamilton Cycles ◽  
Star Graphs ◽  
Edge Disjoint ◽  
Spanning Subgraph ◽  
Optimal Bounds ◽  
Hamilton Decompositions ◽  
Hamilton Decomposition

In interconnection network topologies, the [Formula: see text]-dimensional star graph [Formula: see text] has [Formula: see text] vertices corresponding to permutations [Formula: see text] of [Formula: see text] symbols [Formula: see text] and edges which exchange the positions of the first symbol [Formula: see text] with any one of the other symbols. The star graph compares favorably with the familiar [Formula: see text]-cube on degree, diameter and a number of other parameters. A desirable property which has not been fully evaluated in star graphs is the presence of multiple edge-disjoint Hamilton cycles which are important for fault-tolerance. The only known method for producing multiple edge-disjoint Hamilton cycles in [Formula: see text] has been to label the edges in a certain way and then take images of a known base 2-labelled Hamilton cycle under different automorphisms that map labels consistently. However, optimal bounds for producing edge-disjoint Hamilton cycles in this way, and whether Hamilton decompositions can be produced, are not known for any [Formula: see text] other than for the case of [Formula: see text] which does provide a Hamilton decomposition. In this paper we show that, for all n, not more than [Formula: see text], where [Formula: see text] is Euler’s totient function, edge-disjoint Hamilton cycles can be produced by such automorphisms. Thus, for non-prime [Formula: see text], a Hamilton decomposition cannot be produced. We show that the [Formula: see text] upper bound can be achieved for all even [Formula: see text]. In particular, if [Formula: see text] is a power of 2, [Formula: see text] has a Hamilton decomposable spanning subgraph comprising more than half of the edges of [Formula: see text]. Our results produce a better than twofold improvement on the known bounds for any kind of edge-disjoint Hamilton cycles in [Formula: see text]-dimensional star graphs for general [Formula: see text].

Artinian Local Rings Whose Annihilating-ideal Graphs Are Star Graphs

2015 ◽  
Vol 22 (01) ◽  
pp. 73-82 ◽  
Author(s):  
Houyi Yu ◽  
Tongsuo Wu ◽  
Weiping Gu
Keyword(s):  
Local Ring ◽  
Complete Characterization ◽  
Local Rings ◽  
Star Graph ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Star Graphs ◽  
Finite Local Ring ◽  
Necessary And Sufficient

In this paper, a necessary and sufficient condition is given for a commutative Artinian local ring whose annihilating-ideal graph is a star graph. Also, a complete characterization is established for a finite local ring whose annihilating-ideal graph is a star graph.

Sign in / Sign up

Export Citation Format

Share Document