On Ramsey minimal graphs.
On random greedy triangle packing.
On randomly colouring locally sparse graphs.
On randomly generated non-trivially intersecting hypergraphs.
On Randomly Hamiltonian Graphs.
On rank 2 geometries of the Mathieu group .
On rational radii coin representations of the wheel graph
A flower is a coin graph representation of the wheel graph. A petal of a flower is an outer coin connected to the center coin. The results of this paper are twofold. First we derive a parametrization of all the rational (and hence integer) radii coins of the 3-petal flower, also known as Apollonian circles or Soddy circles. Secondly we consider a general n-petal flower and show there is a unique irreducible polynomial Pₙ in n variables over the rationals ℚ, the affine variety of which contains the...
On recognition of strong graph bundles
On reconstructing of infinite forests
On recursively directed hypercubes.
On regular bipartite-preserving supergraphs.
On Regular Bipartite-Preserving Supergraphs. (Short Communication).
On regular factors in regular graphs with small radius.
ON RELATION BETWEEN SPECTRA OF GRAPHS AND THEIR DIGRAPH DECOMPOSITIONS
On resolving edge colorings in graphs.
On restricted domination in graphs
On restricted unitary Cayley graphs and symplectic transformations modulo .
On robust consensus of multi-agent systems with communication delays
In this paper, two robust consensus problems are considered for a multi-agent system with various disturbances. To achieve the robust consensus, two distributed control schemes for each agent, described by a second-order differential equation, are proposed. With the help of graph theory, the robust consensus stability of the multi-agent system with communication delays is obtained for both fixed and switching interconnection topologies. The results show the leaderless consensus can be achieved with...
On sampling colorings of bipartite graphs.
On second-stage spectrum and energy of a graph