K-outerplanar Graph
   HOME



picture info

K-outerplanar Graph
In graph theory, a ''k''-outerplanar graph is a planar graph that has a planar embedding in which the vertices belong to at most k concentric layers. The outerplanarity index of a planar graph is the minimum value of k for which it is k-outerplanar. Definition An outerplanar graph In graph theory, an outerplanar graph is a graph that has a planar drawing for which all vertices belong to the outer face of the drawing. Outerplanar graphs may be characterized (analogously to Wagner's theorem for planar graphs) by the two f ... (or 1-outerplanar graph) has all of its vertices on the unbounded (outside) face of the graph. A 2-outerplanar graph is a planar graph with the property that, when the vertices on the unbounded face are removed, the remaining vertices all lie on the newly formed unbounded face. And so on. More formally, a graph is k-outerplanar if it has a planar embedding such that, for every vertex, there is an alternating sequence of at most k faces and k vertices of t ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Rhombic Dodecahedral Graph Layers
Rhombic may refer to: *Rhombus, a quadrilateral whose four sides all have the same length (often called a diamond) *Rhombic antenna, a broadband directional antenna most commonly used on shortwave frequencies * polyhedra formed from rhombuses, such as the rhombic dodecahedron or the rhombic triacontahedron or the rhombic dodecahedral honeycomb or the rhombic icosahedron or the rhombic hexecontahedron or the rhombic enneacontahedron or the trapezo-rhombic dodecahedron * other things that exhibit the shape of a rhombus, such as rhombic tiling, Rhombic Chess, rhombic drive, Rhombic Skaapsteker, rhombic egg eater, rhombic night adder, forest rhombic night adder {{disambiguation ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  



MORE