Results 21 to 30 of about 211 (163)
Planar, Outerplanar, and Toroidal Graphs of the Generalized Zero‐Divisor Graph of Commutative Rings
Journal of Mathematics, Volume 2021, Issue 1, 2021., 2021 Let A be a commutative ring with unity and let set of all zero divisors of A be denoted by ZA. An ideal ℐ of the ring A is said to be essential if it has a nonzero intersection with every nonzero ideal of A. It is denoted by ℐ≤eA. The generalized zero‐divisor graph denoted by ΓgA is an undirected graph with vertex set ZA∗ (set of all nonzero zero ...
Abdulaziz M. Alanazi +3 more
wiley +1 more source
A generalization of outerplanar graphs
Discrete Mathematics, 1984 A graph G is said to be W-outerplanar if it can be embedded in the plane so that all vertices of a given set \(W\subset V(G)\) lie on the boundary of one face. A characterization of such graphs is given by means of forbidden subgraphs, and an algorithm for W-outerplanarity testing is described. The results overlap, in part, with those of \textit{V.
Lía Oubiña, R. Zucchello
openaire +2 more sources
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
A generalization of outerplanar graphs [PDF]
Časopis pro pěstování matematiky, 1988 A planar graph is said to be a generalized outerplanar graph if it has an embedding in the plane in which every edge is incident to a vertex laying on the boundary of the outer face. The author presents a characterization of generalized outerplanar graphs by means of a set of exactly 12 forbidden subgraphs (up to homeomorphism).
openaire +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
Algorithms, 2013 The maximum common connected edge subgraph problem is to find a connected graph with the maximum number of edges that is isomorphic to a subgraph of each of the two input graphs, where it has applications in pattern recognition and chemistry.
Takeyuki Tamura, Tatsuya Akutsu
doaj +1 more source
Outerplanar Graphs and Delaunay Triangulations [PDF]
, 2012 Dillencourt [1] showed that all maximal outerplanar graphs can be realized as Delaunay triangulations of points in convex position. In this note, we give two new, alternate proofs.
Alam, Ashraful +2 more
openaire +2 more sources
Drawing Outer 1-planar Graphs with Few Slopes
Journal of Graph Algorithms and Applications, 2015 A graph is outer 1-planar if it admits a drawing where each vertex is on the outer face and each edge is crossed by at most another edge. Outer 1-planar graphs are a superclass of the outerplanar graphs and a subclass of the planar partial 3-trees.
Emilio Di Giacomo +2 more
doaj +1 more source
Outerplanar Graph Drawings with Few Slopes [PDF]
Computational Geometry, 2012 Major revision of the whole ...
Kolja B. Knauer +2 more
openaire +7 more sources
The Planar Index and Outerplanar Index of Some Graphs Associated to Commutative Rings
Discussiones Mathematicae - General Algebra and Applications, 2019 In this paper, we study the planar and outerplanar indices of some graphs associated to a commutative ring. We give a full characterization of these graphs with respect to their planar and outerplanar indices when R is a finite ring.
Barati Zahra, Afkhami Mojgan
doaj +1 more source