Results 101 to 110 of about 16,950 (147)
Total Dominating Sets in Maximal Outerplanar Graphs [PDF]
Graphs and Combinatorics, 2017 A set \(D\subseteq V(G)\) is a total domination set of graph \(G\) if every vertex from \(V(G)\) has a neighbor in \(D\). The minimum cardinality of a total domination set of \(G\) is called total domination number and is denoted by \(\gamma_t(G)\). A recent result from \textit{M. Dorfling} et al. [Discrete Math. 339, No.
M. Lemańska, R. Zuazua, P. Żyliński
semanticscholar +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Oriented diameter of maximal outerplanar graphs
Journal of Graph Theory, 2021Let G be a finite connected undirected graph and G ⇀ a strong orientation of G . The diameter of G ⇀ , denoted by d i a m ( G ⇀ ) , is the maximum directed distance between any two vertices of G ⇀ . The oriented diameter of G is defined as d i a m ⇀ ( G )
Xiaolin Wang +5 more
semanticscholar +3 more sources
Domination and Outer Connected Domination in Maximal Outerplanar Graphs
Graphs and Combinatorics, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
W. Zhuang
semanticscholar +4 more sources
Semipaired domination in maximal outerplanar graphs
Journal of Combinatorial Optimization, 2019Let $G$ be a graph with vertex set $V(G)$. A set $D \subseteq V(G)$ is a dominating set of $G$ if each vertex not in $D$ is adjacent to a vertex in $D$ of $G$. If $G$ has no isolated vertex, then a dominating set $S$ of $G$ is called a semi-paired dominating set of $G$ if every vertex in $S$ is paired with exactly one other vertex in $S$ that is within
Michael A. Henning, P. Kaemawichanurat
semanticscholar +2 more sources
Centers of maximal outerplanar graphs
Journal of Graph Theory, 1980AbstractThe center of a graph is defined to be the subgraph induced by the set of vertices that have minimum eccentricities (i.e., minimum distance to the most distant vertices). It is shown that only seven graphs can be centers of maximal outerplanar graphs.
A. Proskurowski
semanticscholar +3 more sources
When the maximal graph is planar, outerplanar, and ring graph
Discrete Mathematics, Algorithms and Applications, 2018Let [Formula: see text] be a commutative ring with nonzero identity. Let [Formula: see text] denote the maximal graph associated to [Formula: see text], that is, [Formula: see text] is a graph with vertices as non-units of [Formula: see text], where two ...
Arti Sharma, A. Gaur
semanticscholar +3 more sources
Orthogonal grid pointset embeddings of maximal outerplanar graphs
2014 International Conference on Electrical Engineering and Information & Communication Technology, 2014An orthogonal drawing of a planar graph G is a drawing of G where each vertex is mapped to a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments on the grid lines, and any two edges do not cross except at their common end. Clearly the maximum degree of G is at most 4 if G has an orthogonal drawing.
N. Khan +3 more
semanticscholar +2 more sources
A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings
Workshop on Algorithms and Data Structures, 2017In this paper, we study planar drawings of maximal outerplanar graphs with the objective of achieving small height. (We do not necessarily preserve a given planar embedding.) A recent paper gave an algorithm for such drawings that is within a factor of 4
T. Biedl, Philippe Demontigny
semanticscholar +1 more source
Bounds on the Fibonacci Number of a Maximal Outerplanar Graph
The Fibonacci quarterly, 1998All graphs in this article are finite, undirected, without loops or multiple edges. Let G be a graph with vertices vl5 v2,..., vn. The complement in G of a subgraph H is the subgraph of G obtained by deleting all edges in H.
A. F. Alameddine
semanticscholar +1 more source