Graph product

Known as: Graph products 
In mathematics, a graph product is a binary operation on graphs. Specifically, it is an operation that takes two graphs G1 and G2 and produces a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
If G is a graph then a subgraph H is isometric if, for every pair of vertices u, v of H, we have dH(u, v) = dG(u, v) where d is… (More)
Is this relevant?
2014
2014
A path in an edge colored graph G is called a rainbow path if all its edges have pairwise different colors. Then G is rainbow… (More)
  • figure 1
Is this relevant?
2010
2010
Graphs are a versatile structure and abstraction for binary relationships between objects. To gain insight into such… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • table 1
Is this relevant?
Highly Cited
2009
Highly Cited
2009
The main contribution of this work is a new type of graph product, which we call the zig-zag product. Taking a product of a large… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
As most ‘real-world’ data is structured, research in kernel methods has begun investigating kernels for various kinds of… (More)
Is this relevant?
2003
2003
For a restricted class of monoids, we prove that the decidability of the existential theory of word equations is preserved under… (More)
Is this relevant?
2003
2003
We consider powers of regular graphs defined by the weak graph product and give a characterization of maximum-size independent… (More)
Is this relevant?
2000
2000
Graph products have important role in constructing many useful networks. It is known that there are four basic graph products… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Berman and Schnitger gave a randomized reduction from approximating MAX-SNP problems within constant factors arbitrarily close to… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Recent work of Gromov, Epstein, Cannon, Thurston and many others has generated strong interest in the geometric and algorithmic… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?