Diameter of io-decomposable Riordan graphs of the Bell type
Combinatorics
2019-02-01 v1
Abstract
Recently, in the paper \cite{CJKM1} we suggested the two conjectures about the diameter of io-decomposable Riordan graphs of the Bell type. In this paper, we give a counterexample for the first conjecture. Then we prove that the first conjecture is true for the graphs of some particular size and propose a new conjecture. Finally, we show that the second conjecture is true for some special io-decomposable Riordan graphs.
Cite
@article{arxiv.1901.11156,
title = {Diameter of io-decomposable Riordan graphs of the Bell type},
author = {Ji-Hwan Jung},
journal= {arXiv preprint arXiv:1901.11156},
year = {2019}
}
Comments
13 pages, 1 figure, 2 tables