Results 131 to 140 of about 875,640 (148)
Some of the next articles are maybe not open access.

Bounds on the Fibonacci Number of a Maximal Outerplanar Graph

The Fibonacci quarterly, 1998
All 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

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

Large Induced Subgraphs of Bounded Degree in Outerplanar and Planar Graphs

arXiv.org
In this paper, we study the following question. Let $\mathcal G$ be a family of planar graphs and let $k\geq 3$ be an integer. What is the largest value $f_k(n)$ such that every $n$-vertex graph in $\mathcal G$ has an induced subgraph with degree at most
Marco D'Elia, Fabrizio Frati
semanticscholar   +1 more source

Bottleneck matrices of maximal outerplanar graphs with isomorphic underlying trees

Linear and multilinear algebra
In this paper, we consider the entries of the bottleneck matrices of maximal outerplanar graphs with isomorphic underlying trees. We show how the entries of the bottleneck matrix are perturbed when we modify a maximal outerplanar graph into a ...
Jason J. Molitierno
semanticscholar   +1 more source

Large induced subgraph with a given pathwidth in outerplanar graphs

arXiv.org
A long-standing conjecture by Albertson and Berman states that every planar graph of order $n$ has an induced forest with at least $\lceil \frac{n}{2} \rceil$ vertices.
Naoki Matsumoto, Takamasa Yashima
semanticscholar   +1 more source

Acquisition of characteristic sets of block preserving outerplanar graph patterns by a two-stage evolutionary learning method for graph pattern sets

International Journal of Computational Intelligence Studies, 2018
Fumiya Tokuhara   +4 more
semanticscholar   +1 more source

Acquisition of Characteristic Block Preserving Outerplanar Graph Patterns by Genetic Programming Using Label Information

IIAI International Conference on Advanced Applied Informatics, 2016
Fumiya Tokuhara   +4 more
semanticscholar   +1 more source

Using canonical representations of block tree patterns in acquisition of characteristic block preserving outerplanar graph patterns

International Workshop on Computational Intelligence and Applications, 2016
Fumiya Tokuhara   +4 more
semanticscholar   +1 more source

Acquisition of multiple block preserving outerplanar graph patterns by an evolutionary method for graph pattern sets

International Workshop on Computational Intelligence and Applications, 2017
Fumiya Tokuhara   +4 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy