X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
mathematics (2) 2
mathematics, applied (2) 2
[formula omitted]-geodetic (1) 1
[formula omitted]-geodetic digraph (1) 1
apexes (1) 1
characteristic polynomial (1) 1
computer science (1) 1
degree/diameter problem (1) 1
digraphs (1) 1
diregularity (1) 1
discrete mathematics (1) 1
excess (1) 1
excess one digraph (1) 1
extremal digraphs (1) 1
graph theory (1) 1
graphs (1) 1
k-geodetic (1) 1
k-geodetic digraph (1) 1
k-geodetic digraph, moore digraph, the degree/diameter problem (1) 1
k-geodetic digraph, moore digraph, the degree/diameter problem, almost moore digraph (1) 1
kappa-geodetic digraph (1) 1
moore (1) 1
moore bound (1) 1
moore digraphs (1) 1
network topologies (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Discrete Applied Mathematics, ISSN 0166-218X, 08/2019, Volume 266, pp. 331 - 339
Moore digraphs, that is digraphs with out-degree d, diameter k and order equal to the Moore bound M(d,k)=1+d+d2+⋯+dk, arise in the study of optimal network... 
Excess | Degree/diameter problem | Extremal digraphs | [formula omitted]-geodetic | Digraphs | k-geodetic | MATHEMATICS, APPLIED | MOORE | GRAPHS | Apexes | Network topologies | Graph theory
Journal Article
Electronic Journal of Graph Theory and Applications, ISSN 2338-2287, 2014, Volume 2, Issue 2, pp. 150 - 159
A k-geodetic digraph G is a digraph in which, for every pair of vertices u and v (not necessarily distinct), there is at most one walk of length at most k from... 
k-geodetic digraph, moore digraph, the degree/diameter problem, almost moore digraph
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 03/2018, Volume 238, pp. 161 - 166
A digraph in which, for every pair of vertices u and v (not necessarily distinct), there is at most one walk of length ≤k from u to v is called a k-geodetic... 
Moore bound | Excess one digraph | Diregularity | Characteristic polynomial | [formula omitted]-geodetic digraph | k-geodetic digraph | MATHEMATICS, APPLIED | kappa-geodetic digraph | MOORE DIGRAPHS
Journal Article
Electronic Journal of Graph Theory and Applications, ISSN 2338-2287, 04/2015, Volume 3, Issue 1, pp. 1 - 7
The degree/diameter problem for directed graphs is the problem of determining the largest possible order for a digraph with given maximum out-degree d and... 
k-geodetic digraph, moore digraph, the degree/diameter problem
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.