Results 161 to 170 of about 1,288,795 (193)

Lagrangian Relations and Quantum L ∞ Algebras. [PDF]

open access: yesCommun Math Phys
Jurčo B, Pulmann J, Zika M.
europepmc   +1 more source

Subgraph isomorphism in graph classes [PDF]

open access: yesDiscrete Mathematics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shuji Kijima   +2 more
exaly   +5 more sources

On 2-switches and isomorphism classes

open access: yesDiscrete Mathematics, 2012
11 pages, 6 ...
Michael D Barrus
exaly   +5 more sources
Some of the next articles are maybe not open access.

Related searches:

On a class of isomorphic NFSRs

Designs, Codes and Cryptography, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiao-Xin Zhao   +3 more
openaire   +1 more source

The isomorphism classes of the generalized Petersen graphs

open access: yesDiscrete Mathematics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
William Staton
exaly   +2 more sources

Isomorphism Testing in Hookup Classes

SIAM Journal on Algebraic Discrete Methods, 1982
Hookup classes are classes of graphs with a certain type of recursive definition, which can be viewed as a generalization of k-trees. We show that many hookup classes of graphs are isomorphism complete, and give polynomial isomorphism algorithms for the others. Other results in this paper include the development of a structural decomposition for hookup
Klawe, M. M.   +2 more
openaire   +2 more sources

Isomorphism Classes of Graph Bundles

Canadian Journal of Mathematics, 1990
AbstractRecently, M. Hofmeister [4] counted all nonisomorphic double coverings of a graph by using its Ζ2 cohomology groups, and J. Kwak and J. Lee [5] did the same work for some finite-fold coverings. In this paper, we give an algebraic characterization of isomorphic graph bundles, from which we get a formula to count all nonisomorphic graph-bundles ...
KWAK, JH, LEE, JE
openaire   +3 more sources

Classifying Isomorphic Residue Classes

2001
We report on a case study on combining proof planning with computer algebra systems. We construct proofs for basic algebraic properties of residue classes as well as for isomorphisms between residue classes using different proving techniques, which are implemented as strategies in a multi-strategy proof planner.
Andreas Meier 0002   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy