Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,961,301 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.
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
2009
2009
A Wireless Sensor Network Clustering Algorithm Based on Energy and Distance
R. Hou
,
Weizheng Ren
,
Yao Zhang
Second International Workshop on Computer Science…
2009
Corpus ID: 16374714
Considering extremely limited energy of sensor nodes, how to utilize energy of the sensor nodes effectively to prolong survival…
Expand
2005
2005
Structure and asymptotic expansion of multiple harmonic sums
Christian Costermans
,
Jean-Yves Enjalbert
,
V. Minh
,
M. Petitot
International Symposium on Symbolic and Algebraic…
2005
Corpus ID: 10266695
We prove that the algebra of multiple harmonic sums is isomorphic to a shuffle algebra. So the multiple harmonic sums Hs, indexed…
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
1997
1997
An Interpretive Isomorphism Between Binary and Ternary Relations
D. Myers
Structures in Logic and Computer Science
1997
Corpus ID: 33269176
It is well-known that in first-order logic, the theory of a binary relation and the theory of a ternary relation are mutually…
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
1972
1972
One-parameter inverse semigroups
C. Eberhart
,
J. Selden
1972
Corpus ID: 54039019
This is the second in a projected series of three papers, the aim of which is the complete description of the closure of any one…
Expand
Highly Cited
1959
Highly Cited
1959
On characterizations of linear groups. II
Michio Suzuki
1959
Corpus ID: 33981669
Let Lq be the totality of nonsingular 2X2 matrices with determinant 1 over a finite field of q elements. This paper is concerned…
Expand
1949
1949
The topology of ordered Abelian groups
L. W. Cohen
,
C. Goffman
1949
Corpus ID: 53411193
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…
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