An interval t coloring of a graph is a proper edgecoloring of with colors 1, such that at least one edge of G is colored by and the edges incident to each vertex − G G 2, , t ... , 1, 2, , , i i t = ... ( ) v V G ∈ are colored by consecutive colors, where is the degree of the vertex in . In this paper interval edge-colorings of various graph products are investigated. ( ) G d v ( ) G d v v G

In this paper, we verify the diameter of zero divisor graphs with respect to direct product. Keywords—Atomic lattice, complement of graph, diameter, direct product of lattices, 0-distributive lattice, girth, product of graphs, prime ideal, zero divisor graph.

Graph burning is a deterministic discrete time graph process that can be interpreted as a model for the spread of influence in social networks. The burning number of a graph is the minimum number of steps in a graph burning process for that graph. In this paper, we consider the burning number of graph products. We find some general bounds on the burning number of the Cartesian product and the s...

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$.  For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...

An action of Z by automorphisms of a k-graph induces an action of Z by automorphisms of the corresponding k-graph C∗-algebra. We show how to construct a (k + l)-graph whose C∗-algebra coincides with the crossed product of the original k-graph C∗-algebra by Z. We then investigate the structure of the crossed-product C∗-algebra.

An action of Z by automorphisms of a k-graph induces an action of Z by automorphisms of the corresponding k-graph C∗-algebra. We show how to construct a (k + l)-graph whose C∗-algebra coincides with the crossed product of the original k-graph algebra by Z. We then investigate the structure of the crossed-product C∗-algebra.

The graph product is an operator mixing direct and free products. It is already known that free products and direct products of automatic monoids are automatic. The main aim of this paper is to prove that graph products of automatic monoids of finite geometric type are still automatic. A similar result for prefix-automatic monoids

A k-queue layout of a graph G consists of a linear order σ of V (G), and a partition of E(G) into k sets, each of which contains no two edges that are nested in σ. This paper studies queue layouts of graph products and powers.

The tensor product of two graphs, G and H, has a vertex set V (G) × V (H) and an edge between (u, v) and (u′, v′) iff both uu′ ∈ E(G) and vv′ ∈ E(H). Let A(G) denote the limit of the independence ratios of tensor powers of G, limα(G)/|V (G)|. This parameter was introduced in [5], where it was shown that A(G) is lower bounded by the vertex expansion ratio of independent sets of G. In this note w...

Let d ≥ 1 be an integer. From a set of d-dimensional vectors, we obtain a d-dot product graph by letting each vector au correspond to a vertex u and by adding an edge between two vertices u and v if and only if their dot product au · av ≥ t, for some fixed, positive threshold t. Dot product graphs can be used to model social networks. Recognizing a d-dot product graph is known to be NP-hard for...