Results 11 to 20 of about 1,906 (145)
Metric dimension of maximal outerplanar graphs [PDF]
Bulletin of the Malaysian Mathematical Sciences Society, 2019 25 pages, 16 ...
Mercè Claverol Aguas +6 more
+10 more sources
Partial domination of maximal outerplanar graphs [PDF]
Discrete Applied Mathematics, 2020 Several domination results have been obtained for maximal outerplanar graphs (mops). The classical domination problem is to minimize the size of a set $S$ of vertices of an $n$-vertex graph $G$ such that $G - N[S]$, the graph obtained by deleting the closed neighborhood of $S$, is null. A classical result of Chv tal is that the minimum size is at most
Peter Borg, Pawaton Kaemawichanurat
openalex +4 more sources
Double domination in maximal outerplanar graphs [PDF]
, 2021 In a graph $G$, a vertex dominates itself and its neighbors. A subset $S\subseteq V(G)$ is said to be a double dominating set of $G$ if $S$ dominates every vertex of $G$ at least twice. The double domination number $ _{\times 2}(G)$ is the minimum cardinality of a double dominating set of $G$.
Wei Zhuang
openalex +3 more sources
Secure Total Domination Number in Maximal Outerplanar Graphs [PDF]
Discrete Applied MathematicsA subset $S$ of vertices in a graph $G$ is a secure total dominating set of $G$ if $S$ is a total dominating set of $G$ and, for each vertex $u \not\in S$, there is a vertex $v \in S$ such that $uv$ is an edge and $(S \setminus \{v\}) \cup \{u\}$ is also a total dominating set of $G$.
Yasufumi Aita, Toru Araki
openalex +4 more sources
Symmetry breaking in planar and maximal outerplanar graphs [PDF]
Discrete Mathematics, Algorithms and Applications, 2018 The distinguishing number (index) [Formula: see text] ([Formula: see text]) of a graph [Formula: see text] is the least integer [Formula: see text] such that [Formula: see text] has a vertex (edge) labeling with [Formula: see text] labels that is preserved only by a trivial automorphism.
Saeid Alikhani, Samaneh Soltani
openalex +5 more sources
The 2-center Problem in Maximal Outerplanar Graph [PDF]
, 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 ...
Hsiu-Fu Yeh
openalex +3 more sources
Double-Star Isolation of Maximal Outerplanar Graphs ∗
Journal of Physics: Conference Series, 2023 Abstract In the graph G = (V, E), V represents the set of vertices and E represents the set of edges. ℱ represents a family of graphs. A subset S ⊆ V is considered an ℱ -isolating set if G[V\NG[S]] does not contain F as a subgraph for all F ∈ ℱ.
Jingdong Cao +3 more
openalex +2 more sources
Structure and properties of maximal outerplanar graphs.
, 2009 Benjamin Allgeier
openalex +3 more sources
Transactions on Combinatorics, 2022 An optimal labeling of a graph with $n$ vertices and $m$ edges is an injective assignment of the first $n$ nonnegative integers to the vertices, that induces, for each edge, a weight given by the sum of the labels of its end-vertices with the ...
Christian Barrientos, Maged Youssef
doaj +1 more source
Eternal vertex cover number of maximal outerplanar graphs [PDF]
, 2022 Eternal vertex cover problem is a variant of the classical vertex cover problem modeled as a two player attacker-defender game. Computing eternal vertex cover number of graphs is known to be NP-hard in general and the complexity status of the problem for bipartite graphs is open.
Jasine Babu +3 more
openalex +3 more sources