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
-
Weak and Strong Convergence of Split Douglas-Rachford Algorithms for Monotone Inclusions
-
Fixed point theorems for basic θ-contraction and applications
-
A Fast Forward-Backward Algorithm Using Linesearch and Inertial Techniques for Convex Bi-level Optimization Problems with Applications
-
Convergence of self-adaptive Tseng-type algorithms for split variational inequalities and fixed point problems
-
A fast contraction algorithm using two inertial extrapolations for variational inclusion problem and data classification
-
Periodic cycles for an extension of generalized 3x + 1 functions
-
Some remarks on expansive mappings in metric spaces
-
Asymptotically α hemicontractive mappings in Hilbert spaces and a new algorithm for solving associated split common fixed point problem
-
Extreme solution for fractional differential equation with nonlinear boundary condition
-
Generalized Split Feasibility Problem: Solution by Iteration