scholarly journals Oriented diameter of star graphs

2021 ◽  
Author(s):  
K.S. Ajish Kumar ◽  
Deepak Rajendraprasad ◽  
K.S. Sudeep
Keyword(s):  
Star Graphs

scholarly journals Data Analytics for the 3-extra Diagnosability of Bubble-sort Star Graphs

2021 ◽  
Vol 1813 (1) ◽  
pp. 012028
Author(s):  
Jutao Zhao ◽  
Shiying Wang
Keyword(s):  
Data Analytics ◽  
Star Graphs

scholarly journals A method of sharing secrecy using star graphs

2021 ◽  
Vol 1070 (1) ◽  
pp. 012002
Author(s):  
G Prasad ◽  
R Anandan ◽  
G Uma Maheswari
Keyword(s):  
Star Graphs

Mutually Independent Hamiltonianicity of Pancake Graphs and Star Graphs

2008 ◽  
Author(s):  
Cheng-Kuan Lin ◽  
Jimmy J. M. Tan ◽  
Hua-Min Huang ◽  
D. Frank Hsu ◽  
Lih-Hsing Hsu
Keyword(s):  
Star Graphs ◽  
Mutually Independent

Cycle embedding in star graphs with more conditional faulty edges

2011 ◽  
Vol 218 (7) ◽  
pp. 3856-3867 ◽  
Author(s):  
Cheng Dongqin ◽  
Guo Dachang
Keyword(s):  
Star Graphs

scholarly journals Enhancing the spreading of quantum walks on star graphs by additional bonds

2012 ◽  
Vol 11 (5) ◽  
pp. 1273-1286 ◽  
Author(s):  
Anastasiia Anishchenko ◽  
Alexander Blumen ◽  
Oliver Mülken
Keyword(s):  
Quantum Walks ◽  
Star Graphs

FAULT TOLERANT ROUTING IN HYPERCUBES AND STAR GRAPHS

1996 ◽  
Vol 06 (01) ◽  
pp. 127-136 ◽  
Author(s):  
QIAN-PING GU ◽  
SHIETUNG PENG
Keyword(s):  
Free Path ◽  
Fault Tolerant ◽  
Linear Time ◽  
Time Efficiency ◽  
Routing Problem ◽  
Star Graphs ◽  
Linear Time Algorithms ◽  
Better Than

In this paper, we give two linear time algorithms for node-to-node fault tolerant routing problem in n-dimensional hypercubes Hn and star graphs Gn. The first algorithm, given at most n−1 arbitrary fault nodes and two non-fault nodes s and t in Hn, finds a fault-free path s→t of length at most [Formula: see text] in O(n) time, where d(s, t) is the distance between s and t. Our second algorithm, given at most n−2 fault nodes and two non-fault nodes s and t in Gn, finds a fault-free path s→t of length at most d(Gn)+3 in O(n) time, where [Formula: see text] is the diameter of Gn. When the time efficiency of finding the routing path is more important than the length of the path, the algorithms in this paper are better than the previous ones.

Sign in / Sign up

Export Citation Format

Share Document