Super-connected and super-arc-connected Cartesian product of digraphs
In: Information Processing Letters, Jg. 108 (2008-10-01), S. 90-93
Online
unknown
Zugriff:
We study the super-connected, hyper-connected and super-arc-connected Cartesian product of digraphs. The following two main results will be obtained:(i)If @d^+(D"i)=@d^-(D"i)=@d(D"i)=@k(D"i) for i=1,2, then D"1xD"2 is super-@k if and only if D"1xD"2@?DxK"n->(DxK"n->@?K"2->xK"2->,K"2->xK"3->), (ii)If @d^+(D"i)=@d^-(D"i)=@d(D"i)=@l(D"i) for i=1,2, then D"1xD"2 is super-@l if and only if D"1xD"2@?DxK"n->, where @l(D)=@d(D)=1, K"n-> denotes the complete digraph of order n and n>=2.
Titel: |
Super-connected and super-arc-connected Cartesian product of digraphs
|
---|---|
Autor/in / Beteiligte Person: | Meng, Jixiang ; Liu, Juan |
Link: | |
Zeitschrift: | Information Processing Letters, Jg. 108 (2008-10-01), S. 90-93 |
Veröffentlichung: | Elsevier BV, 2008 |
Medientyp: | unknown |
ISSN: | 0020-0190 (print) |
DOI: | 10.1016/j.ipl.2008.04.006 |
Schlagwort: |
|
Sonstiges: |
|