✦ LIBER ✦

Counting representable sets on simple graphs

✍ Scribed by Peter G. Jeavons

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 745 KB
Volume: 47
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90150-m

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Counting stable sets on Cartesian produc

Counting stable sets on Cartesian products of graphs

✍ Florence Forbes; Bernard Ycart 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 552 KB

We study the generating functions for the number of stable sets of all cardinalities, in the case of graphs which are Cartesian products by paths, cycles, or trees. Explicit results are given for products by cliques. Algorithms based on matrix products are derived for grids, cylinders, toruses and h

On set intersection representations of g

On set intersection representations of graphs

✍ Stasys Jukna 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 193 KB 👁 1 views

## Abstract The intersection dimension of a bipartite graph with respect to a type __L__ is the smallest number __t__ for which it is possible to assign sets __A__~__x__~⊆{1, …, __t__} of labels to vertices __x__ so that any two vertices __x__ and __y__ from different parts are adjacent if and only

Set intersection representations for alm

Set intersection representations for almost all graphs

✍ Eaton, Nancy; Grable, David A. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 581 KB

Two variations of set intersection representation are investigated and upper and lower bounds on the minimum number of labels with which a graph may be represented are found that hold for almost all graphs. Specifically, if &(G) is defined to be the minimum number of labels with which G may be repre

Complexity of representation of graphs b

Complexity of representation of graphs by set systems

✍ Svatopluk Poljak; Vojtěch Rödl; Daniel Turzík 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 568 KB

Virasoro representations on fusion graph

Virasoro representations on fusion graphs

✍ Johannes Kellendonk; Andreas Recknagel 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 386 KB

Graphs and topologies on discrete sets

✍ Pascal Préa 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 597 KB

PrCa, P., Graphs and topologies on discrete sets, Discrete Mathematics 103 (1992) 189-197. We show that a graph admits a topology on its node set which is compatible with the usual connectivity of undirected graphs if, and only if, it is a comparability graph. Then, we give a similar condition for