Skip to search formSkip to main contentSkip to account menu

Graph isomorphism

Known as: Isomorphic graphs, Isomorphism (disambiguation), Isomorphic graph 
In graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H such that any two vertices u and v of G are… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
In this paper, the concepts of $L$-concave structures, concave $L$-interior operators and concave $L$-neighborhood systems are… 
2010
2010
It is shown that every  almost linear bijection $h : Arightarrow B$ of a unital $C^*$-algebra $A$ onto a unital$C^*$-algebra $B… 
Highly Cited
2005
Highly Cited
2005
In many multiterminal communication problems, constructions of good source codes involve finding distributed partitions (into… 
2002
2002
La conjecture de « dualite etrange » de Le Potier donne un isomorphisme entre l'espace des sections du fibre determinant sur deux… 
Highly Cited
1999
Highly Cited
1999
ly we have the following setting for our problem. We are given a finite set S of generators and a finite set E of equations of… 
1994
1994
Abstract We show, roughly speaking, that it requires ω iterations of the Turing jump to decode nontrivial information from… 
Highly Cited
1993
Highly Cited
1993
This is a report of the application of the Model Generation Theorem Prover developed at ICOT to problems in the theory of finite… 
Highly Cited
1990
Highly Cited
1990
Let G1, G2 be locally compact groups. We prove in this paper that if T is an isometric isomorphism from the Banach algebra LUC(G1… 
1964
1964
The following theorem is proved: If Gi and Gz are locally compact groups, Ai are algebras of finite regular Borel measures such…