✦ LIBER ✦

A note on unimodular congruence of graphs

✍ Scribed by Russell Merris

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 407 KB
Volume: 201
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(94)90104-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Unimodular congruence of the Laplacian m

Unimodular congruence of the Laplacian matrix of a graph

✍ William Watkins 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 609 KB

A Note on Unimodular Rows

✍ N.Mohan Kumar 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 153 KB

A Note on Optimal Unimodular Lattices

✍ J.H Conway; N.J.A Sloane 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 169 KB

The highest possible minimal norm of a unimodular lattice is determined in dimensions n 33. There are precisely five odd 32-dimensional lattices with the highest possible minimal norm (compared with more than 8.10 20 in dimension 33). Unimodular lattices with no roots exist if and only if n 23, n{25

A Note on Simultaneous Congruences

✍ Trevor D. Wooley 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 466 KB

We prove, by an essentially elementary argument, that the number of nonsingular solutions of a system of d simultaneous congruences, to a prime power modulus, in d variables is at most the product of the degrees of the polynomials defining the congruences. 1996 Academic Press, Inc. where S s, k (n

A note on the total unimodularity of mat

A note on the total unimodularity of matrices

✍ Manfred W. Padberg 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 778 KB

A ri43xsaty and sufficient chiiriweritation lrrf totally unimodular matrices is given ick is derived from a nixewrq~ condbtion for totdi unimodularity due to Camion. II~ ~~~~~~~~~~~~tj~n is then used in cunnectirsrh with a theorem of Hoffman and Kruskal to provide an elcment~ry prwf of the charactea

A note on stability of graphs

✍ Aruna Sharma 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 110 KB

This note provides counter-examples to a conjecture of D.A. Holton on stability of graphs. It is shown that even though the automorphism groups of two graphs are identical, one may be stable while the other is not.