✦ LIBER ✦

Universal sequences for complete graphs

✍ Scribed by N. Alon; Y. Azar; Y. Ravid

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 271 KB
Volume: 27
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(90)90125-v

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Universal traversal sequences for expand

Universal traversal sequences for expander graphs

✍ Shlomo Hoory; Avi Wigderson 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 237 KB

Universal traversal sequences for paths

Universal traversal sequences for paths and cycles

✍ Michael F Bridgland 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 552 KB

Critical groups for complete multipartit

Critical groups for complete multipartite graphs and Cartesian products of complete graphs

✍ Brian Jacobson; Andrew Niedermaier; Victor Reiner 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB

## Abstract The critical group of a connected graph is a finite abelian group, whose order is the number of spanning trees in the graph, and which is closely related to the graph Laplacian. Its group structure has been determined for relatively few classes of graphs, e.g., complete graphs and compl

Complete convergence for α-mixing sequen

Complete convergence for α-mixing sequences

✍ Qi-Man Shao 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 494 KB

A lower bound for area-universal graphs

✍ Gianfranco Bilardi; Shiva Chaudhuri; Devdatt Dubhashi; K. Mehlhorn 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 525 KB

Completeness results for graph isomorphi

Completeness results for graph isomorphism

✍ Birgit Jenner; Johannes Köbler; Pierre McKenzie; Jacobo Torán 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 239 KB

We prove that the graph isomorphism problem restricted to trees and to colored graphs with color multiplicities 2 and 3 is many-one complete for several complexity classes within NC 2 . In particular we show that tree isomorphism, when trees are encoded as strings, is NC 1 -hard under AC 0 -reductio