Results 101 to 110 of about 1,906 (145)
Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs
, 2016 Santiago Canales +3 more
openalex +2 more sources
Remote Monitoring by Edges and Faces of Maximal Outerplanar Graphs
, 2016 Gregorio Hernández Peñalver +1 more
openalex +1 more source
The Rainbow Number of Cycle in Maximal Outerplanar Graph
Changqing Xu +3 more
openalex +1 more source
Reconstruction of maximal outerplanar graphs
Discrete Mathematics, 1972 AbstractS. Ulam has conjectured that every graph with three or more points is uniquely determined by its collection of point-deleted subgraphs. This has been proved for various classes of graphs, but progress has generally been confined to very symmetrical graphs and graphs with connectivity zero or one.
Bennet Manvel
openalex +3 more sources
Total Dominating Sets in Maximal Outerplanar Graphs [PDF]
Graphs and Combinatorics, 2017 A set \(D\subseteq V(G)\) is a total domination set of graph \(G\) if every vertex from \(V(G)\) has a neighbor in \(D\). The minimum cardinality of a total domination set of \(G\) is called total domination number and is denoted by \(\gamma_t(G)\). A recent result from \textit{M. Dorfling} et al. [Discrete Math. 339, No.
Lemańska, Magdalena +2 more
openaire +2 more sources
Oriented diameter of maximal outerplanar graphs
Journal of Graph Theory, 2021 AbstractLet be a finite connected undirected graph and a strong orientation of . The diameter of , denoted by , is the maximum directed distance between any two vertices of . The oriented diameter of is defined as In this paper, we show that for any maximal outerplanar graph of order , with four exceptions, and the upper bound is sharp.
Xiaolin Wang +5 more
openalex +3 more sources
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 ...
Charles J. Colbourn
openalex +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Semipaired domination in maximal outerplanar graphs
Journal of Combinatorial Optimization, 2019Let $G$ be a graph with vertex set $V(G)$. A set $D \subseteq V(G)$ is a dominating set of $G$ if each vertex not in $D$ is adjacent to a vertex in $D$ of $G$. If $G$ has no isolated vertex, then a dominating set $S$ of $G$ is called a semi-paired dominating set of $G$ if every vertex in $S$ is paired with exactly one other vertex in $S$ that is within
Henning, Michael A. +1 more
openaire +1 more source
Convex dominating sets in maximal outerplanar graphs
Discrete Applied Mathematics, 2019In 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 +4 more
+5 more sources