An introduction to \(F\)-graphs, a graph-theoretic representation of natural numbers (Q1187591)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An introduction to \(F\)-graphs, a graph-theoretic representation of natural numbers |
scientific article; zbMATH DE number 39588
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An introduction to \(F\)-graphs, a graph-theoretic representation of natural numbers |
scientific article; zbMATH DE number 39588 |
Statements
An introduction to \(F\)-graphs, a graph-theoretic representation of natural numbers (English)
0 references
13 August 1992
0 references
Summary: A special type of family graphs ( \(F\)-graphs, for brevity) are introduced. These are cactus-type graphs which form infinite families under an attachment operation. Some of the characterizing properties of \(F\)-graphs are discussed. Also, it is shown that, together with the attachment operation, these families form an infinite, commutative semigroup with unit element. Finally, it is shown that \(F\)-graphs are graph-theoretical representations of natural numbers.
0 references
pattern recognition
0 references
semigroup isomorphism
0 references
attaching a graph
0 references
basis graph
0 references
family graphs
0 references
\(F\)-graphs
0 references
cactus-type graphs
0 references
commutative semigroup
0 references
representations of natural numbers
0 references
