Results 11 to 20 of about 968,530 (206)

Fuzzy Outerplanar Graphs and Its Applications

International Journal of Computational Intelligence Systems
The concept of a crisp graph is essential in the study of outerplanar graphs because outerplanar graphs are a unique type of planar graphs containing special characteristics. One of the core concepts of crisp graphs, the notion of a subgraph, is utilized
Deivanai Jaisankar, Sujatha Ramalingam, Nagarajan Deivanayagampillai, Tadesse Walelign   +3 more
semanticscholar   +2 more sources

Double domination in maximal outerplanar graphs

Open Mathematics, 2022
In graph G G , 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 G G if S S dominates every vertex of G G at least twice.
Zhuang Wei, Q. Zheng
semanticscholar   +2 more sources

Strong Chromatic Index of Outerplanar Graphs

Axioms, 2022
The strong chromatic index χs′(G) of a graph G is the minimum number of colors needed in a proper edge-coloring so that every color class induces a matching in G. It was proved In 2013, that every outerplanar graph G with Δ≥3 has χs′(G)≤3Δ−3.
Y. Wang, Yiqiao Wang, Weifan Wang, Shuyu Cui   +3 more
semanticscholar   +3 more sources

Outerplanar graph drawings with few slopes [PDF]

Computational Geometry, 2014
We consider straight-line outerplanar drawings of outerplanar graphs in which a small number of distinct edge slopes are used, that is, the segments representing edges are parallel to a small number of directions.
Bartosz Walczak, Barát, Dujmović, Dujmović, Dujmović, Fáry, Jelínek, Keszegh, Keszegh, Koebe, Kolja Knauer, Mukkamala, Mukkamala, Pach, Piotr Micek, Wade, Wagner   +16 more
core   +7 more sources

The Singularity of Oriented Outerplanar Graphs with a Given Number of Inner Edges

Journal of Mathematics, Volume 2022, Issue 1, 2022., 2022
A digraph is called oriented if there is at most one arc between two distinct vertices. An oriented graph is called nonsingular (singular) if its adjacency matrix A(D) is nonsingular (singular). In this paper, we study the singularity of the oriented outerplanar graph with a given number of inner edges.
Borui He, Xianya Geng, Long Wang, Ali Jaballah   +3 more
wiley   +2 more sources

Planar, Outerplanar, and Toroidal Graphs of the Generalized Zero‐Divisor Graph of Commutative Rings

Journal of Mathematics, Volume 2021, Issue 1, 2021., 2021
Let A be a commutative ring with unity and let set of all zero divisors of A be denoted by ZA. An ideal ℐ of the ring A is said to be essential if it has a nonzero intersection with every nonzero ideal of A. It is denoted by ℐ≤eA. The generalized zero‐divisor graph denoted by ΓgA is an undirected graph with vertex set ZA∗ (set of all nonzero zero ...
Abdulaziz M. Alanazi, Mohd Nazim, Nadeem Ur Rehman, Li Guo   +3 more
wiley   +2 more sources

Choosability with separation of cycles and outerplanar graphs

Discussiones Mathematicae Graph Theory, 2023
We consider the following list coloring with separation problem of graphs: Given a graph $G$ and integers $a,b$, find the largest integer $c$ such that for any list assignment $L$ of $G$ with $|L(v)|\le a$ for any vertex $v$ and $|L(u)\cap L(v)|\le c$ for any edge $uv$ of $G$, there exists an assignment $φ$ of sets of integers to the vertices of $G ...
Togni, Olivier, Godin, Jean-Christophe
openaire   +5 more sources

Image contraction through fuzzy soft outerplanar graph structures. [PDF]

Sci Rep
Fuzzy sets and soft sets serve as powerful mathematical tools to handle uncertainty and vagueness in real-world problems. Building on these, this study introduces the concept of fuzzy soft outerplanar graphs (FSOGs), a fusion of fuzzy soft set theory ...
Jaisankar D, Ramalingam S, Zegeye GB.
europepmc   +2 more sources

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

Sci Rep
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.
Jaisankar D, Ramalingam S, Zegeye GB.
europepmc   +2 more sources

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

Sci Rep
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.
Jaisankar D, Ramalingam S, Deivanayagampillai N, Walelign T.   +3 more
europepmc   +2 more sources