𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Representation of graphs

✍ Scribed by Alon Itai; Michael Rodeh

Publisher
Springer-Verlag
Year
1982
Tongue
English
Weight
254 KB
Volume
17
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Stage-graph representations
Stage-graph representations
✍ Evangelos Kranakis; Danny Krizanc; Anil Maheshwari; Marc Noy; JΓΆrg-RΓΌdiger Sack; πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 634 KB

We consider graph applications of the well-known paradigm "killing two birds with one stone". In the plane, this gives rise to a stage graph as follows: vertices are the points, and {u, II} is an edge if and only if the (infinite, straight) line segment joining u to u intersects the stage. Such grap

Vector representation of graph dominatio
Vector representation of graph domination
✍ Noga Zewi πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 203 KB

## Abstract We study a function on graphs, denoted by β€œGamma”, representing vectorially the domination number of a graph, in a way similar to that in which the Lovsz Theta function represents the independence number of a graph. This function is a lower bound on the homological connectivity of the i

Representations of graphs modulo n
Representations of graphs modulo n
✍ Anthony B. Evans; Gerd H. Fricke; Carl C. Maneri; Terry A. McKee; Manley Perkel πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 757 KB

## Abstract A graph is representable modulo __n__ if its vertices can be labeled with distinct integers between 0 and __n__, the difference of the labels of two vertices being relatively prime to __n__ if and only if the vertices are adjacent. ErdΕ‘s and Evans recently proved that every graph is rep