An equitable k-coloring of an undirected graph G = (V,E) is a partition of its vertices into k disjoint independent sets, such that the cardinalities of any two independent sets differ by at most one. As a variant of the graph coloring problem (GCP), the equitable coloring problem (ECP) concerns finding a minimum k for which an equitable k-coloring exists. In this work, we propose a backtrackin...

We study classic cake-cutting problems, but in discrete models rather than using infiniteprecision real values, specifically, focusing on their communication complexity. Using general discrete simulations of classical infinite-precision protocols (Robertson-Webb and movingknife), we roughly partition the various fair-allocation problems into 3 classes: “easy” (constant number of rounds of logar...

The point-line geometry known as a partial quadrangle (introduced by Cameron in 1975) has the property that for every point/line non-incident pair (P, `), there is at most one line through P concurrent with `. So in particular, the well-studied objects known as generalised quadrangles are each partial quadrangles. An intriguing set of a generalised quadrangle is a set of points which induces an...

This paper investigates how to make decentralised networks, amenable to external control, i.e., how to ensure that they are appropriately organised so that they can be effectively ‘reprogrammed’. In particular, we study networked systems whose interaction dynamics are given by a nearest-neighbour averaging rule, with one leader node providing the control input to the entire system. The main res...

This paper investigates the collective behaviors induced by network interconnection of heterogeneous input-affine single-input nonlinear systems through a constant but general directed graph. In this sense, we prove that dynamics all agents cluster into as many subgroups number cells almost equitable partition communication All belonging to same cell are equally influenced new mean-field which ...

A C4-decomposition of Kv−F , where F is a 1-factor of Kv and C4 is the cycle of length 4, is a partition P of E(Kv − F ) into sets, each element of which induces a C4 (called a block). A function assigning a color to each block defined by P is said to be an (s, p)-equitable block-coloring if: exactly s colors are used; each vertex v is incident with blocks colored with exactly p colors; and the...

Using the intrinsic relationship between the external equitable partition (EEP) and the spectral properties of the graph Laplacian, we characterize convergence and observability properties of consensus dynamics on networks. In particular, we establish the relationship between the original consensus dynamics and the associated consensus of the quotient graph under varied initial conditions, and ...

1 Department of Mathematics, University College of Engineering Nagercoil, Anna University of Technology Tirunelveli (Nagercoil Campus), Nagercoil 629 004, Tamil Nadu, India 2 Department of Mathematics, R.V.S College of Engineering and Technology, Coimbatore 641 402, Tamil Nadu, India 3 Department of Mathematics, Sri Shakthi Institute of Engineering and Technology, Coimbatore 641 062, Tamil Nadu...