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
-
An inertial method for solving the split equality fixed point problem with multiple output sets
-
Asymptotic modeling of non-linear viscopiezoelectric Kelvin-Voigt type plates via Trotter theory
-
Properties of isocompact spaces in topological groups
-
Two generalized cyclic projection algorithms for solving a class of the split feasibility problem in real Hilbert spaces
-
Global-fixed-point property of gyrogroup actions
-
On simple normal structure and best proximity points in reflexive Banach space
-
Unified Convergence Analysis of Certain At Least Fifth Order Methods
-
A set packing model for the Partition Coloring Problem
-
Cut-through connections of graphs
-
Positive solutions for multipoint boundary value problem of fractional differential equation with parameter