✦ LIBER ✦

On the Shannon Capacity of Probabilistic Graphs

✍ Scribed by K. Marton

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 370 KB
Volume: 57
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1993.1015

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Orientations of Self-complementary Graph

Orientations of Self-complementary Graphs and the Relation of Sperner and Shannon Capacities

✍ A. Sali; G. Simonyi 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 81 KB

We prove that the edges of a self-complementary graph and its complement can be oriented in such a way that they remain isomorphic as digraphs and their union is a transitive tournament. This result is used to explore the relation between the Shannon and Sperner capacity of certain graphs. In partic

On the Capacity of Digraphs

✍ Noga Alon 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 76 KB

For a digraph G = (V, E) let w(G n ) denote the maximum possible cardinality of a subset S of V n in which for every ordered pair It is also shown that for every n there is a tournament T on 2n vertices whose capacity is at least √ n, whereas the maximum number of vertices in a transitive subtourna

On the hamiltonian path graph of a graph

✍ George R. T. Hendry 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 491 KB 👁 1 views

The hamiltonian path graph H(F) of a graph F is that graph having the same vertex set as F and in which two vertices u and u are adjacent if and only if F contains a hamiltonian u -u path. First, in response to a conjecture of Chartrand, Kapoor and Nordhaus, a characterization of nonhamiltonian grap

A functional equation for finding the la

A functional equation for finding the largest expected capacity of a graph

✍ N. G. F. Sancho 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 336 KB

On the embedding of graphs into graphs w

On the embedding of graphs into graphs with few eigenvalues

✍ Vu, Van H. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 726 KB

A graph is called of type k if it is connected, regular, and has k distinct eigenvalues. For example graphs of type 2 are the complete graphs, while those of type 3 are the strongly regular graphs. We prove that for any positive integer n, every graph can be embedded in n cospectral, non-isomorphic

On the editing distance of graphs

✍ Maria Axenovich; André Kézdy; Ryan Martin 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB 👁 2 views

## Abstract An edge‐operation on a graph __G__ is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs $\cal G$, the editing distance from __G__ to $\cal G$ is the smallest number of edge‐operations needed to modify __G__ into a graph