Results 11 to 20 of about 3,901 (159)
The Singularity of Oriented Outerplanar Graphs with a Given Number of Inner Edges
Journal of Mathematics, 2022 A digraph is called oriented if there is at most one arc between two distinct vertices. An oriented graph is called nonsingular (singular) if its adjacency matrix AD is nonsingular (singular).
Borui He, Xianya Geng, Long Wang
doaj +2 more sources
Outerplanar graph drawings with few slopes [PDF]
Computational Geometry, 2014 We consider straight-line outerplanar drawings of outerplanar graphs in which a small number of distinct edge slopes are used, that is, the segments representing edges are parallel to a small number of directions.
Bartosz Walczak +16 more
core +7 more sources
Planar, Outerplanar, and Toroidal Graphs of the Generalized Zero-Divisor Graph of Commutative Rings
Journal of Mathematics, 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.
Abdulaziz M. Alanazi +2 more
doaj +2 more sources
Star Coloring Outerplanar Bipartite Graphs
Discussiones Mathematicae Graph Theory, 2019 A proper coloring of the vertices of a graph is called a star coloring if at least three colors are used on every 4-vertex path. We show that all outerplanar bipartite graphs can be star colored using only five colors and construct the smallest known ...
Ramamurthi Radhika, Sanders Gina
doaj +2 more sources
Splitting Plane Graphs to Outerplanarity
Journal of Graph Algorithms and Applications, 2023 Vertex splitting replaces a vertex by two copies and partitions its incident edges amongst the copies. This problem has been studied as a graph editing operation to achieve desired properties with as few splits as possible, most often planarity, for which the problem is NP-hard.Here we study how to minimize the number of splits to turn a plane graph ...
Gronemann, Martin +2 more
openaire +2 more sources
The Electronic Journal of Combinatorics, 2017 A map is outerplanar if all its vertices lie in the outer face. We enumerate various classes of rooted outerplanar maps with respect to the number of edges and vertices. The proofs involve several bijections with lattice paths. As a consequence of our results, we obtain an efficient scheme for encoding simple outerplanar maps.
Geffner, Ivan, Noy, Marc
openaire +4 more sources
Large Induced Acyclic and Outerplanar Subgraphs of 2-Outerplanar Graph [PDF]
Graphs and Combinatorics, 2017 13 pages, 7 figures.
Glencora Borradaile +2 more
openaire +2 more sources
Metric Dimension of Maximal Outerplanar Graphs [PDF]
Bulletin of the Malaysian Mathematical Sciences Society, 2021 25 pages, 16 ...
M. Claverol +6 more
openaire +4 more sources
Irreducible nonmetrizable path systems in graphs
Journal of Graph Theory, Volume 102, Issue 1, Page 5-14, January 2023., 2023 Abstract A path system P ${\mathscr{P}}$ in a graph G =(V , E ) $G=(V,E)$ is a collection of paths with a unique u v $uv$ path for every two vertices u , v ∈ V $u,v\in V$. We say that P ${\mathscr{P}}$ is consistent if for any path P ∈ P $P\in {\mathscr{P}}$, every subpath of P $P$ is also in P ${\mathscr{P}}$.
Daniel Cizma, Nati Linial
wiley +1 more source
Pathlength of Outerplanar Graphs
, 2022 A path-decomposition of a graph G = (V, E) is a sequence of subsets of V , called bags, that satisfy some connectivity properties. The length of a path-decomposition of a graph G is the greatest distance between two vertices that belong to a same bag and the pathlength, denoted by pl(G), of G is the smallest length of its path-decompositions.
Dissaux, Thomas, Nisse, Nicolas
openaire +3 more sources