“…. Thus we can see that the four vertex pairs (1,5), (1,6), (1,7) and (1,8) in CG r 8 have maximal distance 3 i.e., the four vertex pairs (8,4), (8,3), (8,2) and (8, 1) in CG 8 have the maximal distance 3.…”
Recently, in the paper [4] 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.
“…. Thus we can see that the four vertex pairs (1,5), (1,6), (1,7) and (1,8) in CG r 8 have maximal distance 3 i.e., the four vertex pairs (8,4), (8,3), (8,2) and (8, 1) in CG 8 have the maximal distance 3.…”
Recently, in the paper [4] 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.
We calculate the derived series of the Riordan group. To do that, we study a nested sequence of its subgroups, herein denoted by G k . By means of this sequence, we first obtain the n-th commutator subgroup of the Associated subgroup. This fact allows us to get some related results about certain groups of formal power series and to complete the proof of our main goal, Theorem 1 in this paper.
“…In this section, we introduce the notion of a (0, 1)-Riordan matrix of order n, which will play an important role in defining Riordan graphs with n vertices in the next section. First note [10] that the Riordan group R over κ = R or C can be described as an inverse limit of an inverse sequence of groups (R n ) n∈N of finite matrices. So R n is a subgroup of the classical Lie group GL(n, κ), and elements in R n are n×n Riordan matrices denoted by (g, f ) n which are obtained from (infinite) Riordan matrices (g, f ) by taking their leading principal submatrix of order n. Now consider Riordan matrices over the finite field κ = Z 2 .…”
Section: (01)-riordan Matricesmentioning
confidence: 99%
“…In particular, Riordan matrices found applications in the context of the computation of combinatorial sums [34]. Also, see [10] for a recent paper about Lie theory on the Riordan group, which is the set of invertible Riordan matrices.…”
In this paper, we use the theory of Riordan matrices to introduce the notion of a Riordan graph. The Riordan graphs are a far-reaching generalization of the well known and well studied Pascal graphs and Toeplitz graphs, and also some other families of graphs. The Riordan graphs are proved to have a number of interesting (fractal) properties, which can be useful in creating computer networks with certain desirable features, or in obtaining useful information when designing algorithms to compute values of graph invariants. The main focus in this paper is the study of structural properties of families of Riordan graphs obtained from infinite Riordan graphs, which includes a fundamental decomposition theorem and certain conditions on Riordan graphs to have an Eulerian trail/cycle or a Hamiltonian cycle. We will study spectral properties of the Riordan graphs in a follow up paper.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.