๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Some machines defined by directed graphs

โœ Scribed by N.G. De Bruijn

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
946 KB
Volume
32
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Definability by turing machines
Definability by turing machines
โœ R. M. Baer ๐Ÿ“‚ Article ๐Ÿ“… 1969 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 452 KB
General properties of some families of g
General properties of some families of graphs defined by systems of equations
โœ Felix Lazebnik; Andrew J. Woldar ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 200 KB

## Abstract In this paper we present a simple method for constructing infinite families of graphs defined by a class of systems of equations over commutative rings. We show that the graphs in all such families possess some general properties including regularity and biregularity, existence of speci

Defining numbers in some of the Harary g
Defining numbers in some of the Harary graphs
โœ D.A. Mojdeh; A.P. Kazemi ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 376 KB

## Defining set The defining number The strong defining number Harary graph a b s t r a c t In a given graph G = (V , E), a set of vertices S with an assignment of colors to them is said to be a defining set of the vertex coloring of G if there exists a unique extension of the colors of S to a c