Results 51 to 60 of about 119 (107)
Non-Preemptive Tree Packing. [PDF]
Algorithmica, 2023 Lendl S, Woeginger G, Wulf L.
europepmc +1 more source
Metric dimension of maximal outerplanar graphs
, 2019 Preprint
Claverol Aguas, Mercè +6 more
openaire +1 more source
Disjunctive domination in maximal outerplanar graphs
A disjunctive dominating set of a graph $G$ is a set $D \subseteq V(G)$ such that every vertex in $V(G)\setminus D$ has a neighbor in $D$ or has at least two vertices in $D$ at distance $2$ from it. The disjunctive domination number of $G$, denoted by $γ_2^d(G)$, is the minimum cardinality of a disjunctive dominating set of $G$.
Henning, Michael A. +2 more
openaire +2 more sources
Clustering systems of phylogenetic networks. [PDF]
Theory Biosci, 2023 Hellmuth M, Schaller D, Stadler PF.
europepmc +1 more source
The 2-center Problem in Maximal Outerplanar Graph
, 2022 We consider the problem of computing 2-center in maximal outerplanar graph. In this problem, we want to find an optimal solution where two centers cover all the vertices with the smallest radius. We provide the following result. We can compute the optimal centers and the optimal radius in $O(n^2)$ time for a given maximal outerplanar graph with $n ...
openaire +2 more sources
A self-stabilizing algorithm for locating the center of Cartesian product of K2 and maximal outerplanar graphs [PDF]
Annals of computer science and information systems, 2014 Halina Bielak, Michał Pańczyk
doaj +1 more source
Domination of triangulated discs and maximal outerplanar graphs
Applied Mathematics and ComputationzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jarne Renders +2 more
openaire +1 more source
Maxregularity and Maximal Outerplanar Graphs
Electronic Notes in Discrete Mathematics, 1999 R.M.N.D. Rodrigues +2 more
openaire +1 more source
On the Vertex Separation of Maximal Outerplanar Graphs
Serdica Journal of Computing, 2008 We investigate the NP-complete problem Vertex Separation (VS) on Maximal Outerplanar Graphs (mops). We formulate and prove a “main theorem for mops”, a necessary and sufficient condition for the vertex separation of a mop being k. The main theorem reduces the vertex separation of mops to a special kind of stretchability, one that we call affixability ...
openaire +2 more sources
Bounds on the Euler Sombor index of maximal outerplanar graphs [PDF]
Electronic Journal of MathematicsYifan Hu +3 more
doaj +1 more source