✦ LIBER ✦

Immanantal invariants of graphs

✍ Scribed by Russell Merris

Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 185 KB
Volume: 401
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2003.11.033

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Contraction–Deletion Invariants for Grap

Contraction–Deletion Invariants for Graphs

✍ Béla Bollobás; Luke Pebody; Oliver Riordan 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 192 KB

We consider generalizations of the Tutte polynomial on multigraphs obtained by keeping the main recurrence relation T(G)=T(GÂe)+T(G&e) for e # E(G) neither a bridge nor a loop and dropping the relations for bridges and loops. Our first aim is to find the universal invariant satisfying these conditio

Plane graphs and link invariants

✍ François Jaeger 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 803 KB

A (tame) link can be defined as a finite collection of disjoint polygons embedded in Euclidean 3-space. Links are usually represented by plane projections, or diagrams, which can be viewed as 4-regular plane graphs with signed vertices. Then the 3-dimensional concept of ambient isotopy of links can

Dual graphs and knot invariants

✍ Magnhild Lien; William Watkins 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 159 KB

Polynomial invariants of graphs with sta

Polynomial invariants of graphs with state models

✍ Seiya Negami; Kenichi Kawagoe 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 517 KB

Maximum versus minimum invariants for gr

Maximum versus minimum invariants for graphs

📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 488 KB

Two examples in graph theory of the concept of the maximum and minimum pair of invariants resulting from a graphical parameter are ( I ) the chromatic number and its maximum version, the achromatic number, and (2) the genus and the maximum genus. The primary purpose of this expository survey is to p

An invariant of spatial graphs

✍ Shǔji Yamada 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 464 KB

G n B, C P,, then we say that G is aflat vertex graph. For two spatial graphs G and G', if there exists an isotopy h,:R3 + R3 t E [0,1] such that h, = id \*Dedicated to Professor Fujitsugu Hosokawa on his sixtieth birthday.