( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Existence of Disjoint Spanning Paths in Faulty Hypercubes.

, , , , и . J. Interconnect. Networks, 11 (1-2): 71-96 (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Eddie Aamari

Eddie Kohlfeldt

Eddie Hartmann

Eddie Gurnadi

Eddie Quansah

 

Другие публикации лиц с тем же именем

On deriving explicit formulas of the surface areas for the arrangement graphs and some of the related graphs., , и . Int. J. Comput. Math., 87 (13): 2903-2914 (2010)Distance formula and shortest paths for the (n, k)-star graphs., , , , и . Inf. Sci., 180 (9): 1671-1680 (2010)Fractional matching preclusion for generalized augmented cubes., , , и . Discret. Math. Theor. Comput. Sci., (2019)Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs., , и . Int. J. Comput. Math. Comput. Syst. Theory, 7 (4): 207-222 (октября 2022)Linearly many faults in 2-tree-generated networks., , и . Networks, 55 (2): 90-98 (2010)Conditional Matching Preclusion For The Star Graphs., , , , и . Ars Comb., (2015)Strong Fault-Hamiltonicity for the Crossed Cube and Its Extensions., , , , и . Parallel Process. Lett., 27 (2): 1750005:1-1750005:25 (2017)Independent spanning trees on even networks., , , и . Inf. Sci., 181 (13): 2892-2905 (2011)A Concise Survey of Matching Preclusion in Interconnection Networks., и . J. Interconnect. Networks, 19 (3): 1940006:1-1940006:13 (2019)One-to-many node-disjoint paths of hyper-star networks., , , и . Discret. Appl. Math., 160 (13-14): 2006-2014 (2012)