AbstractA result of Ben-Or, Coppersmith, Luby and Rubinfeld on testing whether a map between two groups is close to a homomorphism implies a tight lower bound on the distance between the multiplication tables of two non-isomorphic groups
Summary. Two types of a distance between isomorphism classes of graphs are adapted for rooted trees
here edge-distance) between isomorphism classes of graphs, based on the maximum number of edges of c...
summary:Two types of a distance between isomorphism classes of graphs are adapted for rooted trees
AbstractA result of Ben-Or, Coppersmith, Luby and Rubinfeld on testing whether a map between two gro...
. We examine the minimal distance (number of differing entries) between different group tables of th...
AbstractSuppose that all groups of order n are defined on the same set G of cardinality n, and let t...
summary:In 1986, Chartrand, Saba and Zou [3] defined a measure of the distance between (the isomorph...
This paper is concerned with finite groups G(#) and G(#) of order n that are not isomorphic, and whe...
Put dist(G(·), G(*)) = card{(a, b) εG2; a · b ≠ a * b} for any two groups G(·), G(*) with the same u...
We investigate the minimum distance of the error correcting code formed by the homomorphisms between...
We introduce a new approach which makes it possible to compute upper bounds on the distance between ...
In an article in 1992, Drapal addressed the question of how far apart the multiplication tables of t...
A continuous mapping between compact topological groups which is "almost" a homomorphism need not be...
This chapter describes distances between isomorphism classes or distances between graphs. An isomorp...
This is a project for MTH 466, Graph Theory and Combinatorics. A graph is a mathematical object that...
Summary. Two types of a distance between isomorphism classes of graphs are adapted for rooted trees
here edge-distance) between isomorphism classes of graphs, based on the maximum number of edges of c...
summary:Two types of a distance between isomorphism classes of graphs are adapted for rooted trees
AbstractA result of Ben-Or, Coppersmith, Luby and Rubinfeld on testing whether a map between two gro...
. We examine the minimal distance (number of differing entries) between different group tables of th...
AbstractSuppose that all groups of order n are defined on the same set G of cardinality n, and let t...
summary:In 1986, Chartrand, Saba and Zou [3] defined a measure of the distance between (the isomorph...
This paper is concerned with finite groups G(#) and G(#) of order n that are not isomorphic, and whe...
Put dist(G(·), G(*)) = card{(a, b) εG2; a · b ≠ a * b} for any two groups G(·), G(*) with the same u...
We investigate the minimum distance of the error correcting code formed by the homomorphisms between...
We introduce a new approach which makes it possible to compute upper bounds on the distance between ...
In an article in 1992, Drapal addressed the question of how far apart the multiplication tables of t...
A continuous mapping between compact topological groups which is "almost" a homomorphism need not be...
This chapter describes distances between isomorphism classes or distances between graphs. An isomorp...
This is a project for MTH 466, Graph Theory and Combinatorics. A graph is a mathematical object that...
Summary. Two types of a distance between isomorphism classes of graphs are adapted for rooted trees
here edge-distance) between isomorphism classes of graphs, based on the maximum number of edges of c...
summary:Two types of a distance between isomorphism classes of graphs are adapted for rooted trees
DOI
Add to ORKG