On resolving edge colorings in graphs.
On restricted domination in graphs
On restricted m-ary partitions.
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
On sectional Newtonian graphs
In this paper, we introduce the so-called sectional Newtonian graphs for univariate complex polynomials, and study some properties of those graphs. In particular, we list all possible sectional Newtonian graphs when the degrees of the polynomials are less than five, and also show that every stable gradient graph can be realized as a polynomial sectional Newtonian graph.
On self-complementary cyclic packing of forests.
On semiregular digraphs of the congruence
We assign to each pair of positive integers and a digraph whose set of vertices is and for which there is a directed edge from to if . The digraph is semiregular if there exists a positive integer such that each vertex of the digraph has indegree or 0. Generalizing earlier results of the authors for the case in which , we characterize all semiregular digraphs when is arbitrary.
On Separating Sets of Edges in Contraction-Critical Graphs.
On separating sets of words. I.
On separating sets of words. II.
On separating sets of words. IV.
On separating sets of words. V.
On Sequences satisfying .
On Sequential Heuristic Methods for the Maximum Independent Set Problem
We consider sequential heuristics methods for the Maximum Independent Set (MIS) problem. Three classical algorithms, VO [11], MIN [12], or MAX [6] , are revisited. We combine Algorithm MIN with the α-redundant vertex technique[3]. Induced forbidden subgraph sets, under which the algorithms give maximum independent sets, are described. The Caro-Wei bound [4,14] is verified and performance of the algorithms on some special graphs is considered.
On sets of integers containing k elements in arithmetic progression
On Sets of Integers with Prescribed Gaps.
On sets of vectors of a finite vector space in which every subset of basis size is a basis
It is shown that the maximum size of a set of vectors of a -dimensional vector space over , with the property that every subset of size is a basis, is at most , if , and at most , if , where and is prime. Moreover, for , the sets of maximum size are classified, generalising Beniamino Segre’s “arc is a conic” theorem. These results have various implications. One such implication is that a matrix, with and entries from , has columns which are linearly dependent. Another is...