On the powers of Motzkin paths.
On the prime graphs of the automorphism groups of sporadic simple groups
In this paper as the main result, we determine finite groups with the same prime graph as the automorphism group of a sporadic simple group, except .
On the problem of uniqueness for the maximum Stirling number(s) of the second kind.
On the proof of a theorem of Pálfy.
On the pseudoachromatic number of a graph
On the -analogue of the sum of cubes.
On the -Pell sequences and sums of tails
We examine the -Pell sequences and their applications to weighted partition theorems and values of -functions. We also put them into perspective with sums of tails. It is shown that there is a deeper structure between two-variable generalizations of Rogers-Ramanujan identities and sums of tails, by offering examples of an operator equation considered in a paper published by the present author. The paper starts with the classical example offered by Ramanujan and studied by previous authors noted...
On the q-log-Concavity of Gaussian Binomial Coefficients.
On the quantum chromatic number of a graph.
On the rainbow connection of Cartesian products and their subgraphs
Rainbow connection number of Cartesian products and their subgraphs are considered. Previously known bounds are compared and non-existence of such bounds for subgraphs of products are discussed. It is shown that the rainbow connection number of an isometric subgraph of a hypercube is bounded above by the rainbow connection number of the hypercube. Isometric subgraphs of hypercubes with the rainbow connection number as small as possible compared to the rainbow connection of the hypercube are constructed....
On the Rainbow Vertex-Connection
A vertex-colored graph is rainbow vertex-connected if any two vertices are connected by a path whose internal vertices have distinct colors. The rainbow vertex-connection of a connected graph G, denoted by rvc(G), is the smallest number of colors that are needed in order to make G rainbow vertexconnected. It was proved that if G is a graph of order n with minimum degree δ, then rvc(G) < 11n/δ. In this paper, we show that rvc(G) ≤ 3n/(δ+1)+5 for [xxx] and n ≥ 290, while rvc(G) ≤ 4n/(δ + 1) + 5...
On the Ramsey-Turán number of finite graphs
On the rank of random subsets of finite affine geometry
The aim of the paper is to give an effective formula for the calculation of the probability that a random subset of an affine geometry AG(r-1,q) has rank r. Tables for the probabilities are given for small ranks. The expected time to the first moment at which a random subset of an affine geometry achieves the rank r is derived.
On the Realization of Convex Polytopes, Euler's Formula and Möbius Functions (Short Communication)
On the Realization of Convex Polytopes, Euler's Formula and Möbius Functions
On the recognition of bipolarizable and -simplicial graphs.
On the reconstruction of countable forests.
On the Reconstruction of Latin Squares
On the reconstruction of the matching polynomial and the reconstruction conjecture.
On the Relationships between Zero Forcing Numbers and Certain Graph Coverings
The zero forcing number and the positive zero forcing number of a graph are two graph parameters that arise from two types of graph colourings. The zero forcing number is an upper bound on the minimum number of induced paths in the graph that cover all the vertices of the graph, while the positive zero forcing number is an upper bound on the minimum number of induced trees in the graph needed to cover all the vertices in the graph. We show that for a block-cycle graph the zero forcing number equals...