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… 
2005
2005
We prove that the algebra of multiple harmonic sums is isomorphic to a shuffle algebra. So the multiple harmonic sums Hs, indexed… 
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
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… 
Highly Cited
1959
Highly Cited
1959
Let Lq be the totality of nonsingular 2X2 matrices with determinant 1 over a finite field of q elements. This paper is concerned… 
1949
1949
Introduction. We consider an ordered abelian group G= [x] in which the identity 6 is not isolated: if x, y>6 in G then x+y>d…