Results 111 to 120 of about 16,950 (147)

Co-maximal Graph, its Planarity and Domination Number

J. Interconnect. Networks, 2020
Let R be a finite commutative ring with identity. The co-maximal graph Γ(R) is a graph with vertices as elements of R, where two distinct vertices a and b are adjacent if and only if Ra + Rb = R.
Deepa Sinha, A. Rao
semanticscholar   +1 more source

Farey Series and Maximal Outerplanar Graphs

SIAM Journal on Algebraic Discrete Methods, 1982
Certain graphs representing Farey series of irreducible fractions are shown to be maximal outerplanar. For a suitable generalization of Farey series, the class of graphs obtained is exactly the class of maximal outerplanar graphs. Using a representation of maximal outerplanar graphs as series of irreducible fractions, efficient algorithms for deciding ...
openaire   +2 more sources

Convex dominating sets in maximal outerplanar graphs

Discrete Applied Mathematics, 2019
In this paper, we study the concept of convex domination in maximal outerplanar graphs. For this class of graphs, we discuss several properties of this domination parameter, in particular, we provide upper bounds on the convex domination number and study effects on the convex domination number when a maximal outerplanar graph is modified by flipping a ...
Magdalena Lemańska, Eduardo Rivera-Campo, Radosław Ziemann, Rita Zuazua, Paweł Żyliński   +4 more
  +5 more sources

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

Connected domination in maximal outerplanar graphs

Discrete Applied Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Isolation number of maximal outerplanar graphs

Discrete Applied Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tokunaga, Shin-ichi, Jiarasuksakun, Thiradet, Kaemawichanurat, Pawaton   +2 more
openaire   +2 more sources

Independent Sets of Cardinality s of Maximal Outerplanar Graphs

The Fibonacci quarterly, 2013
In 1982, Prodinger and Tichy defined the Fibonacci number f(G) to be the number of independent sets in the graph G. Let α(G) be the cardinality of a maximum independent set of G and fs = fs(G) be the number of independent sets of cardinality s in G. Then
John Estes, W. Staton, Bing Wei
semanticscholar   +1 more source

Boundary-type sets in maximal outerplanar graphs

Discrete Applied Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Allgeier, Benjamin, Kubicki, Grzegorz
openaire   +1 more source

Sombor index of maximal outerplanar graphs

Discrete Applied Mathematics
Let \(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
openaire   +1 more source

Odd 4-Coloring of Outerplanar Graphs

Graphs and Combinatorics
A proper k-coloring of G is called an odd coloring of G if for every vertex v, there is a color that appears at an odd number of neighbors of v. This concept was introduced recently by Petruševski and Škrekovski, and they conjectured that every planar ...
Masaki Kashima, Xuding Zhu
semanticscholar   +1 more source