𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Finite type graphs and some graph operations, II

✍ Scribed by Miroslav M Petrović

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
346 KB
Volume
58
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we study a finite type property of graphs obtained by some n-ary operations on infinite graphs, continuing earlier work of A. Torgagev and the author.

📜 SIMILAR VOLUMES

Some Graph Theoretical Operations and De
Some Graph Theoretical Operations and Decidability
✍ Detlef G. Seese 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 378 KB

In [5, 61 a criterion for the undecidability of second order theories of classes of graphs is introduced. This criterion leads to a "measure of complexity" of a class of graphs. In this note we introduce some graph theoretical operations and prove that the class of all graphs which have the smallest

Encapsulated Hierarchical Graphs, Graph
Encapsulated Hierarchical Graphs, Graph Types, and Meta Types
✍ Gregor Engels; Andy Schürr 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 401 KB

Currently existing graph grammar-based speci cation languages have serious problems with supporting any kind of \speci cation-in-the-large" activities. More precisely, t h e y h a ve de ciences with respect to modeling hierarchical data structures or specifying meta activities like manipulation of g