Results 21 to 30 of about 584,165 (157)
Generalized outerplanar index of a graph [PDF]
, 2018 summary:We define the generalized outerplanar index of a graph and give a full characterization of graphs with respect to this ...
Barati, Zahra
core +1 more source
Straight-Line Grid Drawings of Label-Constrained Outerplanar Graphs with O(n log n) Area
Journal of Graph Algorithms and Applications, 2011 A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segment without edge crossings.
Md. Rezaul Karim +2 more
doaj +1 more source
Small Area Drawings of Outerplanar Graphs [PDF]
, 2006 We show three linear time algorithms for constructing planar straight-line grid drawings of outerplanar graphs. The first and the second algorithm are for balanced outerplanar graphs. Both require linear area. The drawings produced by the first algorithm
Frati, Fabrizio +3 more
core +1 more source
Minimum Cycle Base of Graphs Identified by Two Planar Graphs [PDF]
, 2007 In this paper, we study the minimum cycle base of the planar graphs obtained from two 2-connected planar graphs by identifying an edge (or a cycle) of one graph with the corresponding edge (or cycle) of another, related with map geometries, i.e ...
Han, Ren, Dengju, Ma
core +1 more source
Genus Distributions of Cubic Outerplanar Graphs
Journal of Graph Algorithms and Applications, 2011 We present a quadratic-time algorithm for computing the genus distribution of any 3-regular outerplanar graph. Although recursions and some formulas for genus distributions have previously been calculated for bouquets and for various kinds of ladders ...
Jonathan Gross
doaj +1 more source
Maximally Expressive GNNs for Outerplanar Graphs [PDF]
, 2023 We propose a linear time graph transformation that enables the Weisfeiler-Leman (WL) test and message passing graph neural networks (MPNNs) to be maximally expressive on outerplanar graphs.
Gärtner, Thomas; orcid: +8 more
core +3 more sources
On k-edge-magic labelings of maximal outerplanar graphs
AKCE International Journal of Graphs and Combinatorics, 2015 Let G be a graph with vertex set V and edge set E such that |V|=p and |E|=q. We denote this graph by (p,q)-graph. For integers k≥0, define a one-to-one map f from E to {k,k+1,…,k+q−1} and define the vertex sum for a vertex v as the sum of the labels of ...
Gee-Choon Lau +3 more
doaj +1 more source
The Degree-Diameter Problem for Outerplanar Graphs
Discussiones Mathematicae Graph Theory, 2017 For positive integers Δ and D we define nΔ,D to be the largest number of vertices in an outerplanar graph of given maximum degree Δ and diameter D. We prove that nΔ,D=ΔD2+O (ΔD2−1)$n_{\Delta ,D} = \Delta ^{{D \over 2}} + O\left( {\Delta ^{{D \over 2 ...
Dankelmann Peter +2 more
doaj +1 more source
On the Planarity of Generalized Line Graphs
Theory and Applications of Graphs, 2019 One of the most familiar derived graphs is the line graph. The line graph $L(G)$ of a graph $G$ is that graph whose vertices are the edges of $G$ where two vertices of $L(G)$ are adjacent if the corresponding edges are adjacent in~$G$.
Khawlah H. Alhulwah +2 more
doaj +1 more source
Structure and properties of maximal outerplanar graphs. [PDF]
, 2009 Outerplanar graphs are planar graphs that have a plane embedding in which each vertex lies on the boundary of the exterior region. An outerplanar graph is maximal outerplanar if the graph obtained by adding an edge is not outerplanar. Maximal outerplanar
Allgeier, Benjamin
core +1 more source