✦ LIBER ✦

Dominating sets of maximal outerplanar graphs

✍ Scribed by Tokunaga, Shin-ichi

Book ID: 122435538
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 339 KB
Volume: 161
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.06.025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On dominating sets of maximal outerplana

On dominating sets of maximal outerplanar graphs

✍ C.N. Campos; Y. Wakabayashi 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 239 KB

Minimum dominating cycles in outerplanar

Minimum dominating cycles in outerplanar graphs

✍ Andrzej Proskurowski; Maciej M. Sysło 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 615 KB

Reconstruction of maximal outerplanar gr

Reconstruction of maximal outerplanar graphs

✍ Bennet Manvel 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 1011 KB 👁 1 views

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.

Maxregularity and Maximal Outerplanar Gr

Maxregularity and Maximal Outerplanar Graphs

✍ R.M.N.D. Rodrigues; N.M.M. Abreu; L. Markenzon 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 269 KB

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