AbstractIn this paper, we enumerate prime graphs with respect to the Cartesian multiplication of graphs. We use the unique factorization of a connected graph into the product of prime graphs given by Sabidussi to find explicit formulas for labeled and unlabeled prime graphs. In the case of species, we construct the exponential composition of species based on the arithmetic product of species of Maia and Méndez, and express the species of connected graphs as the exponential composition of the species of prime graphs
Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to...
Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to...
In 1996, H. Stark and A. Terras noted that a special type of closed path in undirected graphs (ones ...
AbstractIn this paper, we enumerate prime graphs with respect to the Cartesian multiplication of gra...
In enumerative combinatorics, it is often a goal to enumerate both labeled and unlabeled structures ...
In enumerative combinatorics, it is often a goal to enumerate both labeled and unlabeled structures ...
AbstractWe consider the computational complexity of recognizinf concerned cartesian product graphs. ...
We introduce and investigate a new class of graphs arrived from exponential congruences. For each pa...
Since singletons are the connected sets, the species $X$ of singletons can be considered as the comb...
AbstractIn order to study the functorial composition of species, we introduce the auxiliary concepts...
AbstractIn this paper we consider S-prime graphs, that is the graphs that cannot be represented as n...
We present an algorithm that determines the prime factors of connected graphs with respect to the Ca...
1. Prime graphs. Let $G $ be a finite group and $\Gamma(G) $ be the prime graph of $G $. This is the...
AbstractIn this paper, we study formal power series with exponents in a category. For example, the g...
The Cartesian product G??????????????????????????????????????????????????? V(G)×V(H) and (a,x)(b,y) ...
Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to...
Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to...
In 1996, H. Stark and A. Terras noted that a special type of closed path in undirected graphs (ones ...
AbstractIn this paper, we enumerate prime graphs with respect to the Cartesian multiplication of gra...
In enumerative combinatorics, it is often a goal to enumerate both labeled and unlabeled structures ...
In enumerative combinatorics, it is often a goal to enumerate both labeled and unlabeled structures ...
AbstractWe consider the computational complexity of recognizinf concerned cartesian product graphs. ...
We introduce and investigate a new class of graphs arrived from exponential congruences. For each pa...
Since singletons are the connected sets, the species $X$ of singletons can be considered as the comb...
AbstractIn order to study the functorial composition of species, we introduce the auxiliary concepts...
AbstractIn this paper we consider S-prime graphs, that is the graphs that cannot be represented as n...
We present an algorithm that determines the prime factors of connected graphs with respect to the Ca...
1. Prime graphs. Let $G $ be a finite group and $\Gamma(G) $ be the prime graph of $G $. This is the...
AbstractIn this paper, we study formal power series with exponents in a category. For example, the g...
The Cartesian product G??????????????????????????????????????????????????? V(G)×V(H) and (a,x)(b,y) ...
Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to...
Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to...
In 1996, H. Stark and A. Terras noted that a special type of closed path in undirected graphs (ones ...