Paper Info
Title
Degree/diameter Problem for Mixed Graphs
Abstract
The Degree/diameter problem asks for the largest graphs given diameter and maximum degree. This problem has been extensively studied both for directed and undirected graphs, ando also for special classes of graphs. In this work we present the state of art of the degree/diameter problem for mixed graphs.
Year
DOI
Venue
2015
10.1016/j.procs.2015.12.066
Procedia Computer Science
Keywords
Field
DocType
Degree/diameter problem,Moore bound,mixed Moore graph.
Data mining,Graph,Mathematical optimization,Indifference graph,Combinatorics,Moore graph,Computer science,Chordal graph,Mixed graph,Degree (graph theory),Longest path problem,Degree diameter problem
Conference
Volume
ISSN
Citations 
74
1877-0509
3
PageRank 
References 
Authors
0.52
21
2
Name
Order
Citations
PageRank
Nacho López1439.42
Hebert Pérez-rosés25311.04