DM

2011

13 years 2 months ago
2011

We show that regular median graphs of linear growth are the Cartesian product of ﬁnite hypercubes with the two-way inﬁnite path. Such graphs are Cayley graphs and have only tw...

TKDE

1998

13 years 11 months ago
1998

E cient storage and retrieval of multi-attribute datasets have become one of the essential requirements for many data-intensive applications. The Cartesian product le has been kno...

COMBINATORICS

2000

13 years 11 months ago
2000

Let (G) denote the domination number of a graph G and let G H denote the Cartesian product of graphs G and H. We prove that (G)(H) 2(G H) for all simple graphs G and H. 2000 Math...

ENDM

2007

13 years 11 months ago
2007

We ﬁnd exact values for the game chromatic number of the Cartesian product graphs Sm Pn, Sm Cn, P2 Wn, and P2 Km,n. This extends previous results of Bartnicki et al. on the game...

JIIS

2006

13 years 11 months ago
2006

A join of two relations in real databases is usually much smaller than their cartesian product. This means that most of the combinations of tuples in the crossproduct of the respe...

DM

2007

13 years 11 months ago
2007

We present an algorithm that determines the prime factors of connected graphs with respect to the Cartesian product in linear time and space. This improves a result of Aurenhammee...

DAM

2007

13 years 11 months ago
2007

This note extends results of Fern´andez, Leighton, and L´opez-Presa on the uniqueness of rth roots for disconnected graphs with respect to the Cartesian product to other product...

JGT

2008

13 years 11 months ago
2008

: This article proves the following result: Let G and G be graphs of orders n and n , respectively. Let G be obtained from G by adding to each vertex a set of n degree 1 neighbors....

COMBINATORICS

2007

13 years 11 months ago
2007

We study the structure of a minimum dominating set of Cn 2n+1, the Cartesian product of n copies of the cycle of size 2n + 1, where 2n + 1 is a prime.

EJC

2008

13 years 11 months ago
2008

The distinguishing number D(G) of a graph G is the least integer d such that G has a labeling with d labels that is preserved only by a trivial automorphism. We prove that Cartesi...