## 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.
โฆ LIBER โฆ
Maxregularity and Maximal Outerplanar Graphs
โ Scribed by R.M.N.D. Rodrigues; N.M.M. Abreu; L. Markenzon
- Book ID
- 108498094
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 269 KB
- Volume
- 3
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Centers of maximal outerplanar graphs
โ
Andrzej Proskurowski
๐
Article
๐
1980
๐
John Wiley and Sons
๐
English
โ 178 KB
Linear algorithms to recognize outerplan
โ
Sandra L. Mitchell
๐
Article
๐
1979
๐
Elsevier Science
๐
English
โ 490 KB
On reconstructing maximal outerplanar gr
โ
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
Reconstruction of maximal outerplanar gr
โ
Bennet Manvel
๐
Article
๐
1972
๐
Elsevier Science
๐
English
โ 1011 KB
๐ 1 views
Farey Series and Maximal Outerplanar Gra
โ
Colbourn, Charles J.
๐
Article
๐
1982
๐
Society for Industrial and Applied Mathematics
โ 451 KB
On dominating sets of maximal outerplana
โ
C.N. Campos; Y. Wakabayashi
๐
Article
๐
2013
๐
Elsevier Science
๐
English
โ 239 KB