๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A note on planar graphs

โœ Scribed by David P. Brown; Alan Budner


Publisher
Elsevier Science
Year
1965
Tongue
English
Weight
612 KB
Volume
280
Category
Article
ISSN
0016-0032

No coin nor oath required. For personal study only.

โœฆ Synopsis


Some new properties of the distribution of elements and vertices with respect to the windows of a connected planar graph G are established. It is also shown that a window matrix of G has properties similar to the properties of an incidence matrix of a graph which is not necessarily planar. A method to form the inverse of a nonsingular submatrix of a window matrix directly from the graph is given.


๐Ÿ“œ SIMILAR VOLUMES


A Note on l1-rigid Planar Graphs
โœ M. Deza; J. Tลฏma ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 198 KB
Note on vertex degrees of planar graphs
โœ Miroslaw Truszczyรกski ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 202 KB ๐Ÿ‘ 2 views
On cleaving a planar graph
โœ Shankar M. Venkatesan ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 423 KB
A note on conservative graphs
โœ Arthur T. White ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 115 KB

## Abstract An application of conservative graphs to topological graph theory is indicated.

A note on coset graphs
โœ Ulrike Baumann ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 90 KB

## Abstract Coset graphs are a generalization of Cayley graphs. They arise in the construction of graphs and digraphs with transitive automorphism groups. Moreover, the consideration of coset graphs makes it possible to give an algebraic description of regular connected graphs of even degree. In th

A note on visibility graphs
โœ F Luccio; S Mazzone; C.K Wong ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 602 KB

Given a set S = {s 1, s 2, ..., s,,) of vertical line segments, si, sj see each other ff there is a horizontal line segment which intersects them, but does not intersect any other line segment between them. A ws" ibility graph G of vertices {vl, v2, โ€ข .., v,,} is put into a one-to-one correspondenc