Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,216,349 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
2014
2014
A Study on the Sparing Number of the Corona of Certain Graphs
K. Chithra
,
K. A. Germina
,
N. Sudev
2014
Corpus ID: 117484277
An integer additive set-indexer (IASI) is defined as an injective function $f:V(G)\rightarrow \mathcal{P}(\mathbb{N}_0)$ such…
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 Ftp-time Inapproximability of Independent Set and Related Problems Subexponential and Fpt-time Inapproximability of Independent Set and Related Problems
B. Escoffier
,
Eun Jung Kim
,
V. Paschos
2012
Corpus ID: 11549572
Fixed-parameter algorithms, approximation algorithms and moderately exponential algorithms are three major approaches to…
Expand
Review
2011
Review
2011
Extrapolating (omega-)regular model checking
Axel Legay
International Journal on Software Tools for…
2011
Corpus ID: 254080017
(Omega-)Regular model checking is the name of a family of techniques in which states are represented by words, sets of states by…
Expand
2009
2009
C*-algebras of Graph Products
Ann Johnston
,
Andrew Reynolds
,
B. Kahng
2009
Corpus ID: 17587474
For certain graphs, we can associate a universal C*-algebra, which encodes the information of the graph algebraically. In this…
Expand
2009
2009
Intersecting Families , Independent Sets and Coloring of Certain Graph Products
Igor Shinkar
,
Irit Dinur
2009
Corpus ID: 53984199
We study analytical methods applied to combinatorial problems. Speci cally, we use techniques from Fourier analysis in order to…
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
1978
1978
A generalized measure of independence and the strong product of graphs
B. Barnes
,
K. Mackey
Networks
1978
Corpus ID: 206312504
This work extends the results of M. Rosenfeld [6] on universal graphs with respect to the strong graph product. By using a…
Expand