Game colouring directed graphs.
General numeration II. Division schemes.
This is the second in a series of two papers on numeration schemes. Whereas the first paper emphasized grouping as exemplified in the partition of a number so as to obtain its base two numeral, the present paper takes at its point of departure the method of repeated divisions, as in the calculation of the base two numeral for a number by dividing it by two, then dividing the quotient by two, etc., and collecting the remainders. This method is a sort of classification scheme - odd or even.
Generalizations Of A Reccurence Relation For The Characteristic Polynomials Of Trees
Generalized indices of Boolean matrices
We obtain upper bounds for generalized indices of matrices in the class of nearly reducible Boolean matrices and in the class of critically reducible Boolean matrices, and prove that these bounds are the best possible.
Generalized uniformly line vulnerable digraphs
Geography played on an -cycle times a 4-cycle.
Graph isomorphisms of partially ordered sets
Graphs and associative triples in quasitrivial groupoids
Graphs associated with nilpotent Lie algebras of maximal rank.
In this paper, we use the graphs as a tool to study nilpotent Lie algebras. It implies to set up a link betwcen graph theory and Lie theory. To do this, it is already known that every nilpotent Lie algebra of maximal rank is associated with a generalized Cartan matrix A and it ils isomorphic to a quotient of the positive part n+ of the KacMoody algebra g(A). Then, if A is affine, we can associate n+ with a directed graph (from now on, we use the term digraph) and we can also associate a subgraph...
Graphs of semigroups
Groupoids with non-associative triples on the diagonal