Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Graph product is a fundamental tool with rich applications in both graph theory and theoretical computer science. It is usually… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Lack of realistic benchmarks hinders efficient design and evaluation of analysis techniques for feature models. We extract a… Expand
  • figure 1
  • figure 3
  • table I
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
2008
Highly Cited
2008
From specialists in the field, learn about interesting connections and recent developments in the field of graph theory by… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Berman and Schnitger gave a randomized reduction from approximating MAX-SNP problems within constant factors arbitrarily close to… Expand
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… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
The main contribution is a new type of graph product, which we call the zig-zag product. Taking a product of a large graph with a… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Associative products are defined using a scheme of Imrich & Izbicki [18]. These include the Cartesian, categorical, strong and… Expand
  • figure 1
  • figure 1
  • figure 2
  • table 1
  • figure 3
Is this relevant?
Highly Cited
1990
Highly Cited
1990
In the 1970's Baudisch introduced the idea of the semifree group, that is, a group in which the only relators are commutators of… Expand
Is this relevant?
1989
1989
The problem of computing the chromatic number of a graph is considered. No known approximation algorithm can guarantee a better… Expand
Is this relevant?
Highly Cited
1978
Highly Cited
1978
A new graph product i s introduced, and t h e c h a r a c t e r i s t i c polynomial of a graph so-formed i s given a s a… Expand
  • figure 2
  • figure 3
Is this relevant?