Additional Information
| Author(s) | Tașcu, Ioana, Zelina, Ioana |
|---|
Simple paths of maximum length in star graphs
Ioana Zelina ♦ Ioana Tașcu
Full PDF
carpathian_2008_24_2_120_125The star graph has been known as an attractive model for interconnection networks due to its topological properties, capacity to simulate other basic network topologies and possibility to design efficient communication algorithms. In this paper we study the possibility to embed an array between any two nodes of a star graph and then we show that between any two nodes of a n-star graph there is a simple path that contains at least n! – 2 nodes.
Recently posted
-
Stability of new functional equations and partial multipliers in Banach *-algebras
-
Characterizations of amenable gyrogroups related to Tarski's Theorem
-
Two new extragradient methods for solving pseudomonotone the equilibrium problem in Hilbert spaces
-
On the error estimates for the sequence of successive approximations for cyclic \varphi–contractions in metric spaces
-
Hybrid CG-Like Algorithm for Nonlinear Equations and Image Restoration
-
New class of n-order fractional differential equations and solvability in the double sequence space m^2(\Delta_{v}^{u}, \phi,p)
-
Constructing DNA Codes using Double Cyclic Codes of Odd and Even Lengths over F2 + u F2
-
Consequences of the product rule in Stieltjes differentiability
-
On the existence and uniqueness of fixed points in Banach spaces using the Krasnoselskij iterative method
-
A quaternionic product of simple ratios