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
New compact representations of infinite graphs are investigated. Finite automata are used to represe...
It has recently been shown that infinite matroids can be axiomatized in a way that is very similar t...
A simple graph G = (V, E) is word-representable if there exists a word w over the alphabet V such th...
Abstract. An S-graph is a graph G which is isomorphic to the complement of.2G Here, we present thre...
We discuss some methods for rigorous expressions of infinite labeled directed graphs. In these metho...
The rational graphs are a family of graphs characterized by rational transducers. This family is gen...
Abstract. Two general methods of constructing an infinite sequence (G = GI, G,,......) of graceful g...
[EN] There are different ways to associate to a finite group a certain graph. An interesting questio...
In Mathematics, one of the significant areas is graphs. A graph is a mathematical diagram used to sh...
AbstractAn important part of computer science is focused on the links that can be established betwee...
Research Doctorate - Doctor of Philosophy (PhD)There is a strong connection between directed graphs ...
AbstractWe study graphs defined on families of finite sets of natural numbers and their chromatic pr...
Abstract: In this paper we introduced a new concept of graph of any finite group and we obtained gra...
We construct a graph expansion from a semigroup with a given generating set, thereby generalizing th...
Abstract. There are different ways to associate to a finite group a certain graph. An interesting qu...
New compact representations of infinite graphs are investigated. Finite automata are used to represe...
It has recently been shown that infinite matroids can be axiomatized in a way that is very similar t...
A simple graph G = (V, E) is word-representable if there exists a word w over the alphabet V such th...
Abstract. An S-graph is a graph G which is isomorphic to the complement of.2G Here, we present thre...
We discuss some methods for rigorous expressions of infinite labeled directed graphs. In these metho...
The rational graphs are a family of graphs characterized by rational transducers. This family is gen...
Abstract. Two general methods of constructing an infinite sequence (G = GI, G,,......) of graceful g...
[EN] There are different ways to associate to a finite group a certain graph. An interesting questio...
In Mathematics, one of the significant areas is graphs. A graph is a mathematical diagram used to sh...
AbstractAn important part of computer science is focused on the links that can be established betwee...
Research Doctorate - Doctor of Philosophy (PhD)There is a strong connection between directed graphs ...
AbstractWe study graphs defined on families of finite sets of natural numbers and their chromatic pr...
Abstract: In this paper we introduced a new concept of graph of any finite group and we obtained gra...
We construct a graph expansion from a semigroup with a given generating set, thereby generalizing th...
Abstract. There are different ways to associate to a finite group a certain graph. An interesting qu...
New compact representations of infinite graphs are investigated. Finite automata are used to represe...
It has recently been shown that infinite matroids can be axiomatized in a way that is very similar t...
A simple graph G = (V, E) is word-representable if there exists a word w over the alphabet V such th...