Permutation of sparse matrices to a specific lower BFT using graph decompositions.
Ponzoni, Ignacio, Sánchez, Mabel C., Brignole, Nélida B. (1998)
Electronic Journal of SADIO [electronic only]
Similarity:
Displaying similar documents to “Representing Equivalence Problems for Combinatorial Objects”
Permutation of sparse matrices to a specific lower BFT using graph decompositions.
Hadamard matrices and strongly regular graphs with the 3-e. c. adjacency property.
Bonato, Anthony, Holzmann, W.H., Kharaghani, Hadi (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The strongly regular (45, 12, 3, 3) graphs.
Coolsaet, Kris, Degraer, Jan, Spence, Edward (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Extension of line-splitting operation from graphs to binary matroids.
Azanchiler, Habib (2006)
Lobachevskii Journal of Mathematics
Similarity:
Discussing graph theory with a computer. II: Theorems suggested by the computer.
Cvetkovic, Dragos M. (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
On some regularities of graphs. II.
Zofia Majcher (1984)
Časopis pro pěstování matematiky
Similarity:
Matrices representable by directed graphs
Zofia Majcher (1985)
Archivum Mathematicum
Similarity:
On Graph-Based Cryptography and Symbolic Computations
V. A., Ustimenko (2007)
Serdica Journal of Computing
Similarity:
We have been investigating the cryptographical properties of in nite families of simple graphs of large girth with the special colouring of vertices during the last 10 years. Such families can be used for the development of cryptographical algorithms (on symmetric or public key modes) and turbocodes in error correction theory. Only few families of simple graphs of large unbounded girth and arbitrarily large degree are known. The paper is devoted to the more general theory of directed...
Graphic matrices
Zofia Majcher (1988)
Mathematica Slovaca
Similarity: