No abstract

No abstract

In graph theory, different types of matrices associated with graph, e.g. Adjacency matrix, Incidence matrix, Laplacian matrix etc. Among all adjacency matrix play an important role in graph theory. Many products of two graphs as well as its generalized form had been studied, e.g., cartesian product, 2−cartesian product, tensor product, 2−tensor product etc. In this paper, we discuss the adjacency matrix of two new product of graphs G H, where = ⊗2, ×2. Also, we obtain the spectrum of these products of graphs.

The tensor product and the Cartesian product of two graphs are very well-known graph products and studied in detail. Many graph parameters, particularly independence number, have been studied for these graph products. These two graph products have been generalized by [Formula: see text]-tensor product and [Formula: see text]-Cartesian product, respectively, and studied in detail. In this paper, we discuss the independence number for [Formula: see text]-tensor product [Formula: see text] and [Formula: see text]-Cartesian product [Formula: see text]. In general, we obtain lower bound and upper bound for the independence number.

Weakly analytic sets for function algebra is studied by Arenson in (Arenson). Here, we study the concept of weakly analytic sets for Cartesian product of function algebras. We express the weakly analytic sets for Cartesian product of function algebra in terms of that for factor algebras.