Super link-connectivity of iterated line digraphs

Author： Cheng X.   Du X.   Min M.   Q. Ngo H.   Ruan L.   Sun J.   Wu W.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.304, Iss.1, 2003-07, pp. : 461-469

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Broadcasting Protocol in Line Digraphs

By Bermond J-C.   Muñoz X.   Marchetti-Spaccamela A.  

Journal of Parallel and Distributed Computing, Vol. 61, Iss. 8, 2001-08 ,pp. : 1013-1032

Academic Press

Access to resources Recommend Favorite

The super spanning connectivity and super spanning laceability of the enhanced hypercubes

By Chang Chung-Hao   Lin Cheng-Kuan   Tan Jimmy   Huang Hua-Min   Hsu Lih-Hsing  

The Journal of Supercomputing, Vol. 48, Iss. 1, 2009-04 ,pp. : 66-87

Springer Publishing Company

Access to resources Recommend Favorite

On the structure of minimum broadcast digraphs

By Fertin G.  

Theoretical Computer Science, Vol. 245, Iss. 2, 2000-08 ,pp. : 203-216

Elsevier

Access to resources Recommend Favorite

On Absorbing Cycles in Min–Max Digraphs

By Günzel Harald   Jongen Hubertus  

Journal of Global Optimization, Vol. 31, Iss. 1, 2005-01 ,pp. : 85-92

Springer Publishing Company

Access to resources Recommend Favorite

Asymptotic Enumeration of Extensional Acyclic Digraphs

By Wagner Stephan  

Algorithmica, Vol. 66, Iss. 4, 2013-08 ,pp. : 829-847

Springer Publishing Company

Access to resources Recommend Favorite