Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On connectivity of consecutive-\(d\) digraphs

From MaRDI portal
Publication:1850019
Jump to:navigation, search

DOI10.1016/S0012-365X(02)00436-3zbMath1011.05035MaRDI QIDQ1850019

Ding-Zhu Du, G. W. Peck, Hung Quang Ngo, D. Frank Hsu

Publication date: 2 December 2002

Published in: Discrete Mathematics (Search for Journal in Brave)


zbMATH Keywords

communication networks


Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)


Related Items (6)

EULERIAN AND HAMILTONIAN DICYCLES IN DIRECTED HYPERGRAPHS ⋮ ON THE TWIN DOMINATION NUMBER IN GENERALIZED DE BRUIJN AND GENERALIZED KAUTZ DIGRAPHS ⋮ On 3-restricted edge connectivity of undirected binary Kautz graphs ⋮ Power domination in generalized undirected de Bruijn graphs and Kautz graphs ⋮ Miscellaneous Digraph Classes ⋮ Onm-restricted edge connectivity of undirected generalized De Bruijn graphs




This page was built for publication: On connectivity of consecutive-\(d\) digraphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1850019&oldid=14234089"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 11:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki