Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,545,139 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Gert Sabidussi
Graph (discrete mathematics)
Graph operations
Graph power
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Delft University of Technology A Module-System Discipline for Model-Driven Software Development
Sebastian Erdwega
,
Klaus Ostermannb
2018
Corpus ID: 3988957
Model-driven development is a pragmatic approach to software development that embraces domainspecific languages (DSLs), where…
Expand
2014
2014
A Study on Integer Additive Set-Graceful Graphs
N. Sudev
,
K. A. Germina
2014
Corpus ID: 118903992
A set-labeling of a graph $G$ is an injective function $f:V(G)\to \mathcal{P}(X)$, where $X$ is a finite set and a set-indexer of…
Expand
2012
2012
Testing Small Set Expansion in General Graphs
Angsheng Li
,
Pan Peng
Symposium on Theoretical Aspects of Computer…
2012
Corpus ID: 8082056
We consider the problem of testing small set expansion for general graphs. A graph $G$ is a $(k,\phi)$-expander if every subset…
Expand
2012
2012
Subexponential and FPT-time Inapproximability of Independent Set and Related Problems
B. Escoffier
,
Eun Jung Kim
,
V. Paschos
arXiv.org
2012
Corpus ID: 8037578
Fixed-parameter algorithms, approximation algorithms and moderately exponential algorithms are three major approaches to…
Expand
2011
2011
Irreversible k-threshold and majority conversion processes on complete multipartite graphs and graph products
Sarah Spence Adams
,
Zachary Brass
,
Connor Stokes
,
Denise Sakai Troxell
The Australasian Journal of Combinatorics
2011
Corpus ID: 10276630
In graph theoretical models of the spread of disease through populations, the spread of opinion through social networks, and the…
Expand
2005
2005
Chromatic numbers and products
D. Duffus
,
N. Sauer
Discrete Mathematics
2005
Corpus ID: 34443820
2002
2002
Bounds on the signed domination number of a graph
R. Haas
,
Thomas B. Wexler
Electron. Notes Discret. Math.
2002
Corpus ID: 15020717
1999
1999
Tenacity of complete graph products and grids
S. Choudum
,
N. Priya
Networks
1999
Corpus ID: 122253830
Computer or communication networks are so designed that they do not easily get disrupted under external attack and, moreover…
Expand
Highly Cited
1996
Highly Cited
1996
Testing of the long code and hardness for clique
J. Håstad
Symposium on the Theory of Computing
1996
Corpus ID: 14683039
We prove that unless NP = COR, Max Clique is hard to approximate wit hin polynomial time within a factor ni /2 ‘c for any c >0…
Expand
1988
1988
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Gérard Cohen
,
Marc Giusti
,
T. Mora
Lecture Notes in Computer Science
1988
Corpus ID: 1816878
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE