Results 111 to 120 of about 1,906 (145)
Some of the next articles are maybe not open access.
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.
openaire +2 more sources
On dominating sets of maximal outerplanar graphs
Discrete Applied Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
C.N. Campos, Yoshiko Wakabayashi
openalex +2 more sources
Connected domination in maximal outerplanar graphs
Discrete Applied Mathematics, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Isolation number of maximal outerplanar graphs
Discrete Applied Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tokunaga, Shin-ichi +2 more
openaire +2 more sources
Domination and Outer Connected Domination in Maximal Outerplanar Graphs
Graphs and Combinatorics, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Sombor index of maximal outerplanar graphs
Discrete Applied MathematicsLet \(G = (V(G), E(G))\) be a graph. The degree of a vertex \(v\) in \(G\) is denoted by \(d(v)\). The Somber index of the graph \(G\) is defined as \(\operatorname{SO}(G) = \sum_{xy \in E(G)} \sqrt{d^2(x) + d^2(y)}\). In this paper, the authors prove that if \(G\) is a maximal outerplanar graph of order \(n\), then \[ \operatorname{SO}(G) \geq 4(2n ...
Yunping Li, Hanyuan Deng, Zikai Tang
openalex +2 more sources
Boundary-type sets in maximal outerplanar graphs
Discrete Applied Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Allgeier, Benjamin, Kubicki, Grzegorz
openaire +1 more source
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 distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if there is ...
Sharma, Arti, Gaur, Atul
openaire +2 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.
Naima Khan +3 more
openaire +1 more source
Chromatic number of square of maximal outerplanar graphs
Applied Mathematics-A Journal of Chinese Universities, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources