A note on degree/diameter monotonicity of digraphs

被引：0

作者：

Filipovski, Slobodan ^{[1
]}

机构：

[1] Univ Primorska, Koper, Slovenia

来源：

AUSTRALASIAN JOURNAL OF COMBINATORICS | 2018年 / 70卷

关键词：

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let n(d,k) be the largest order of a directed graph (digraph) with given maximum out-degree d and diameter k. In this note we show that n(d,k) is strictly monotonic increasing in each of d and k.

引用

页码：12 / 14

页数：3

共 50 条

[1] Diameter and maximum degree in Eulerian digraphs
Dankelmann, Peter
Dorfling, Michael
DISCRETE MATHEMATICS, 2016, 339 (04) : 1355 - 1361
[2] Large Cayley digraphs of given degree and diameter
Vetrik, Tomas
DISCRETE MATHEMATICS, 2012, 312 (02) : 472 - 475
[3] Random Cayley digraphs of diameter 2 and given degree
Lladser, Manuel E.
Potocnik, Primoz
Siran, Jozef
Wilson, Mark C.
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2012, 14 (02): : 83 - 90
[4] MINIMUM DIAMETER OF DIREGULAR DIGRAPHS OF DEGREE-2
MILLER, M
FRIS, I
COMPUTER JOURNAL, 1988, 31 (01): : 71 - 75
[5] A note on diameter and the degree sequence of a graph
Mukwembi, Simon
APPLIED MATHEMATICS LETTERS, 2012, 25 (02) : 175 - 178
[6] Monotonicity of strong searching on digraphs
Yang, Boting
Cao, Yi
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2007, 14 (04) : 411 - 425
[7] Monotonicity of strong searching on digraphs
Boting Yang
Yi Cao
Journal of Combinatorial Optimization, 2007, 14 : 411 - 425
[8] On the monotonicity of minimum diameter with respect to order and maximum out-degree
Miller, M
Slamin
COMPUTING AND COMBINATORICS, PROCEEDINGS, 2000, 1858 : 193 - 201
[9] Directed searching digraphs: Monotonicity and complexity
Yang, Boting
Cao, Yi
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2007, 4484 : 136 - +
[10] Revisiting the Comellas-Fiol-Gomez constructions of large digraphs of given degree and diameter
Zdimalova, Maria
DISCRETE MATHEMATICS, 2010, 310 (09) : 1439 - 1444

← 1 2 3 4 5 →