Results 1 to 10 of about 16,950 (147)

Double domination in maximal outerplanar graphs

open access: yesOpen Mathematics, 2022
In graph GG, a vertex dominates itself and its neighbors. A subset S⊆V(G)S\subseteq V\left(G) is said to be a double-dominating set of GG if SS dominates every vertex of GG at least twice.
Zhuang Wei, Zheng Qiuju
doaj   +3 more sources

Bipolar fuzzy outerplanar graphs approach in image shrinking [PDF]

open access: yesScientific Reports
Bipolar fuzzy outerplanar graphs are interesting and significant subclasses within the broader field of fuzzy graph theory. In this paper, bipolar fuzzy outerplanar graphs, and its properties are introduced.
Deivanai Jaisankar   +3 more
doaj   +3 more sources

A Characterization of Maximal Outerplanar-Open Distance Pattern Uniform Graphs

open access: yesمجلة بغداد للعلوم, 2023
Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)
BIBIN K JOSE
doaj   +2 more sources

Metric Dimension of Maximal Outerplanar Graphs [PDF]

open access: yesBulletin of the Malaysian Mathematical Sciences Society, 2019
In this paper, we study the metric dimension problem in maximal outerplanar graphs. Concretely, if β(G)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage ...
M. Claverol   +6 more
semanticscholar   +8 more sources

Double-Star Isolation of Maximal Outerplanar Graphs ∗

open access: yesJournal of Physics: Conference Series, 2023
In the graph G = (V, E), V represents the set of vertices and E represents the set of edges. ℱ represents a family of graphs. A subset S ⊆ V is considered an ℱ -isolating set if G[V\NG[S]] does not contain F as a subgraph for all F ∈ ℱ.
Jingdong Cao   +3 more
semanticscholar   +2 more sources

The 2-center Problem in Maximal Outerplanar Graph [PDF]

open access: yesarXiv.org, 2022
We consider the problem of computing 2-center in maximal outerplanar graph. In this problem, we want to find an optimal solution where two centers cover all the vertices with the smallest radius. We provide the following result.
Hsiu-Fu Yeh
semanticscholar   +3 more sources

A fuzzy graph theoretic approach to face shape recognition using cubic outerplanar structures [PDF]

open access: yesScientific Reports
The well-known topic of crisp graph planarity is contrasted with the more new and thoroughly studied field of planarity inside a fuzzy framework. In cubic fuzzy domain, cubic multisets with interval and fuzzy number to capture vagueness.
Deivanai Jaisankar   +2 more
doaj   +2 more sources

Network design for bypass roads using interval valued fuzzy outerplanar graphs [PDF]

open access: yesScientific Reports
This paper presents a novel approach to bypass road network design using interval valued fuzzy outerplanar graphs (IVFOGs), addressing the increasing demands of vehicular growth and evolving lifestyles.
Deivanai Jaisankar   +3 more
doaj   +2 more sources

Secure Total Domination Number in Maximal Outerplanar Graphs

open access: yesDiscrete 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   +4 more sources

Dominating sets inducing large components in maximal outerplanar graphs [PDF]

open access: yesJournal of Graph Theory, 2015
For a maximal outerplanar graph G of order n at least three, Matheson and Tarjan showed that G has domination number at most n/3 . Similarly, for a maximal outerplanar graph G of order n at least five, Dorfling, Hattingh, and Jonck showed, by a ...
José D. Alvarado   +2 more
semanticscholar   +4 more sources

Home - About - Disclaimer - Privacy