$G$

The Existence of Completely Independent Spanning Trees for Some Compound Graphs

IEEE Transactions on Parallel and Distributed Systems, pp. 201-210, 2020.

Cited by: 2|Bibtex|Views2|Links
EI WOS
Keywords:
CompoundsData centersHypercubesServersNetwork architectureMore(2+)

Abstract:

Given two regular graphs <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$G
lt;/tex-math><alternatives><mml:math><mml:mi>G</mml:mi></mml:math><inline-graphic xlink:href="hao-ieq1-2931904.gif"/></alternatives></inline-formula> and <inline-formula xmlns:mm...More

Code:

Data:

Your rating :
0

 

Tags
Comments