Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,517,496 papers from all fields of science
Search
Sign In
Create Free Account
Graph isomorphism
Known as:
Isomorphic graphs
, Isomorphism (disambiguation)
, Isomorphic graph
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
Analysis of algorithms
Bipartite double cover
Carl Ebeling
Circle packing theorem
Expand
Broader (1)
Graph theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
CHARACTERIZATIONS OF L-CONVEX SPACES
B. Pang
,
Yi Zhao
2016
Corpus ID: 54932104
In this paper, the concepts of $L$-concave structures, concave $L$-interior operators and concave $L$-neighborhood systems are…
Expand
2014
2014
A computational approach to construct a multivariate complete graph invariant
M. Dehmer
,
F. Emmert-Streib
,
M. Grábner
Information Sciences
2014
Corpus ID: 31418832
2010
2010
ISOMORPHISMS IN UNITAL C -ALGEBRAS
Choonkill Park
,
Rassias Th.M.
2010
Corpus ID: 123507329
It is shown that every almost linear bijection $h : Arightarrow B$ of a unital $C^*$-algebra $A$ onto a unital$C^*$-algebra $B…
Expand
Highly Cited
2005
Highly Cited
2005
Generalized coset codes for distributed binning
S. Pradhan
,
K. Ramchandran
IEEE Transactions on Information Theory
2005
Corpus ID: 15184474
In many multiterminal communication problems, constructions of good source codes involve finding distributed partitions (into…
Expand
2002
2002
Résultats sur la conjecture de dualité étrange sur le plan projectif
Gentiana Danila
2002
Corpus ID: 28433714
La conjecture de « dualite etrange » de Le Potier donne un isomorphisme entre l'espace des sections du fibre determinant sur deux…
Expand
Highly Cited
1999
Highly Cited
1999
Jewels are Forever
J. Karhumäki
,
H. Maurer
,
G. Paun
,
G. Rozenberg
Springer Berlin Heidelberg
1999
Corpus ID: 30178955
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…
Expand
1994
1994
Boolean algebras, Stone spaces, and the iterated Turing jump
C. Jockusch
,
R. Soare
Journal of Symbolic Logic (JSL)
1994
Corpus ID: 15291501
Abstract We show, roughly speaking, that it requires ω iterations of the Turing jump to decode nontrivial information from…
Expand
Highly Cited
1993
Highly Cited
1993
Automatic Generation of Some Results in Finite Algebra
M. Fujita
,
J. Slaney
,
F. Bennett
International Joint Conference on Artificial…
1993
Corpus ID: 16157391
This is a report of the application of the Model Generation Theorem Prover developed at ICOT to problems in the theory of finite…
Expand
Highly Cited
1990
Highly Cited
1990
Isometric isomorphisms between Banach algebras related to locally compact groups
F. Ghahramani
,
A. Lau
,
V. Losert
1990
Corpus ID: 120200884
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…
Expand
1964
1964
Isometric isomorphisms of measure algebras
B. Johnson
1964
Corpus ID: 40166922
The following theorem is proved: If Gi and Gz are locally compact groups, Ai are algebras of finite regular Borel measures such…
Expand
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