Search for: [Abstract = "Moreover, it was given the solutions of recurences using Fibonacci numbers, generating functions. Next it was explored the bounds for the domatic numbers of graph products. It was considered the following graph products\: the cartesian product of two graphs, the strong product of two graphs, the join of graphs, the k\-corona of two graphs, the contraction of the complete subgraph of a graph into a new vertex and the duplication of a vertex of a graph. It was also characterized the graphs achieving the obtained bounds."]

Number of results: 1