Results 161 to 170 of about 969,499 (193)

Secure Total Domination Number in Maximal Outerplanar Graphs

Discrete Applied Mathematics
A 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
Yasufumi Aita, Toru Araki
semanticscholar   +1 more source

The $$p-$$Arboricity of Outerplanar Graphs

Graphs and Combinatorics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mingyuan Ma, Han Ren
openaire   +1 more source

The decycling number of outerplanar graphs

Journal of Combinatorial Optimization, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huilan Chang, Hung-Lin Fu, Min-Yun Lien
openaire   +2 more sources

Connected domination in maximal outerplanar graphs

Discrete Applied Mathematics, 2020
A subset S of vertices in a graph G = ( V , E ) is a connected dominating set of G if every vertex of V ∖ S is adjacent to a vertex in S and the subgraph induced by S is connected.
W. Zhuang
semanticscholar   +1 more source

On list‐coloring outerplanar graphs

Journal of Graph Theory, 2008
AbstractWe prove that a 2‐connected, outerplanar bipartite graph (respectively, outerplanar near‐triangulation) with a list of colors L (v ) for each vertex v such that $|L(v)|\geq\min\{{\deg}(v),4\}$ (resp., $|L(v)|\geq{\min}\{{\deg}(v),5\}$) can be L‐list‐colored (except when the graph is K3 with identical 2‐lists).
openaire   +2 more sources

Spectral extremal problems on outerplanar and planar graphs

Discrete Mathematics
Let $\emph{spex}_{\mathcal{OP}}(n,F)$ and $\emph{spex}_{\mathcal{P}}(n,F)$ be the maximum spectral radius over all $n$-vertex $F$-free outerplanar graphs and planar graphs, respectively.
Xilong Yin, Dan Li
semanticscholar   +1 more source

An algorithm for outerplanar graphs with parameter

Journal of Algorithms, 1991
Summary: For \(n\)-vertex outerplanar graphs, it is proven that \(O(n^{2.87})\) is an upper bound on the number of breakpoints of the function which gives the maximum weight of an independent set, where the vertex weights vary as linear functions of a parameter. An \(O(n^{2.87})\) algorithm for finding the solution is proposed.
Binghuan Zhu, Wayne Goddard
openaire   +2 more sources

Tight Minimum Degree Conditions for Apex‐Outerplanar Minors and Subdivisions in Graphs and Digraphs

Journal of Graph Theory
Motivated by Hadwiger's conjecture and related problems for list‐coloring, we study graphs for which every graph with minimum degree at least contains as a minor. We prove that a large class of apex‐outerplanar graphs satisfies this property.
Chun-Hung Liu, Youngho Yoo
semanticscholar   +1 more source

Independent covers in outerplanar graphs

1988
A subset U of vertices of a plane graph is said to be a perfect face-independent vertex cover (FIVC) if and only if each face has exactly one vertex in U. Necessary and sufficient conditions for a maximal plane graph to have a perfect FIVC are derived.
Maciej M. Syslo, Pawel Winter
openaire   +1 more source

Proximity Drawings of Outerplanar Graphs.

1997
A proximity drawing of a graph is one in which pairs of adjacent vertices are drawn relatively close together according to some proximity measure while pairs of non-adjacent vertices are drawn relatively far apart. The fundamental question concerning proximity drawability is: Given a graph G and a definition of proximity, is it possible to construct a ...
W. Lenhart, LIOTTA, Giuseppe
openaire   +2 more sources