Some conditions for the existence of (d,k)-digraphs

Authors:
Yus Mochamad Cholily;Edy Tri Baskoro;Saladin Uttunggadewa
Affiliations:
Department of Mathematics, Institut Teknologi Bandung (ITB), Bandung, Indonesia;Department of Mathematics, Institut Teknologi Bandung (ITB), Bandung, Indonesia;Department of Mathematics, Institut Teknologi Bandung (ITB), Bandung, Indonesia
Venue:
IJCCGGT'03 Proceedings of the 2003 Indonesia-Japan joint conference on Combinatorial Geometry and Graph Theory
Year:
2003

Citing 8
Cited 0

Strategies for interconnection networks: some methods from graph theory

Journal of Parallel and Distributed Computing
Minimum diameter of diregular digraphs of degree 2

The Computer Journal
Dense bipartite digraphs

Journal of Graph Theory
On the existence of (d,k)-digraphs

Discrete Mathematics
Almost Moore digraphs are diregular

Discrete Mathematics
Enumeration of almost Moore digraphs of diameter two

Discrete Mathematics - Special issue on the 17th british combinatorial conference selected papers
Line digraph iterations and the (d,k) problem for directed graphs

ISCA '83 Proceedings of the 10th annual international symposium on Computer architecture
Complete characterization of almost Moore digraphs of degree three

Journal of Graph Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

A (d,k)-digraph is a diregular digraph of degree d ≥ 4, diameter k ≥ 3 and the number of vertices d+d2+...+dk. The existence problem of (d,k)-digraphs is one of difficult problem. In this paper, we will present some new necessary conditions for the existence of such digraphs.