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

On dominating sets of maximal outerplanar graphs

โœ Scribed by C.N. Campos; Y. Wakabayashi

Book ID
118063724
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
239 KB
Volume
161
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On reconstructing maximal outerplanar gr
On reconstructing maximal outerplanar graphs
โœ William B. Giles ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 421 KB

Let C; be a graph, u a vertex of G, and G -{u) the subgraph of G obtained from G by removing the vertex u and all arcs incident with u. G-$1 is calted a point~e~eti~n of G. In f 51, Ulam conjectured that if G has at least three vertices, then G can be reconstructed (up to isomorphism) froin the coil

Centers of maximal outerplanar graphs
Centers of maximal outerplanar graphs
โœ Andrzej Proskurowski ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 178 KB

## Abstract The center of a graph is defined to be the subgraph induced by the set of vertices that have minimum eccentricities (i.e., minimum distance to the most distant vertices). It is shown that only seven graphs can be centers of maximal outerplanar graphs.