✦ LIBER ✦

Almost all trees are co-immanantal

✍ Scribed by Russell Merris

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 333 KB
Volume: 150
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(91)90159-t

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Almost all trees share a complete set of

Almost all trees share a complete set of immanantal polynomials

✍ Phillip Botti; Russell Merris 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 371 KB

## Abstract Let χ be an irreducible character of the symmetric group __S__~__n__~. For an __n__‐by‐__n__ matrix __A__ = (__a__~__ij__~), define equation image If __G__ is a graph, let __D__(__G__) be the diagonal matrix of its vertex degrees and __A__(__G__) its adjacency matrix. Let __y__ and __

Almost All Maps Are Asymmetric

✍ L.B. Richmond; N.C. Wormald 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 291 KB

We give a simple proof of the fact that for a wide variety of classes of maps on surfaces, almost all maps in the class are asymmetric. Our method is based on recent results on the appearance of submaps in the classes. 'c. 1995 Academic Press, Inc.

Almost all comparability graphs are UPO

✍ Rolf H. Möhring 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 430 KB

An undirected graph G is called a comparability graph if there exists an orientation of its edges such that the resulting relation on its vertex set is a partial order P. A comparability graph is UPO (i.e. uniquely partially orderable) if, except for its dual p-x, there is only one such partial orde

Almost all Cayley graphs are hamiltonian

✍ Meng Jixiang; Huang Qiongxiang 📂 Article 📅 1996 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 278 KB

Almost all webs are not rank-perfect

✍ Arnaud Pêcher; Annegret K. Wagler 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 270 KB

All trees are 1-embeddable and all excep

All trees are 1-embeddable and all except stars are 2-embeddable

✍ C.R.J. Clapham; J. Sheehan 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 484 KB

Clapham, C.R.J. and J. Sheehan, All trees are I-embeddable and all except stars are 2-embeddable, Discrete Mathematics 120 (1993) 253-259. A graph G with n vertices is said to be embeddable (in its complement) if there is an automorphism 4 of K, such that E(G)nE(&G))=@. It is known that all trees