Results 1 to 10 of about 192 (144)
Bipolar fuzzy outerplanar graphs approach in image shrinking [PDF]
Scientific ReportsBipolar 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
Image contraction through fuzzy soft outerplanar graph structures [PDF]
Scientific ReportsFuzzy 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 ...
Deivanai Jaisankar +2 more
doaj +2 more sources
A fuzzy graph theoretic approach to face shape recognition using cubic outerplanar structures [PDF]
Scientific ReportsThe 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]
Scientific ReportsThis 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
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 ...
Jean-Christophe Godin, Oliver Togni
doaj +4 more sources
Equitable colorings of outerplanar graphs
Discrete Mathematics, 2002 A proper vertex coloring of a graph \(G\) is said to be equitable if the sizes of any two color classes differ by at most 1. It was conjectured by \textit{H. P. Yap} and \textit{Y. Zhang} [Bull. Inst. Math., Acad. Sin. 25, 143-149 (1997; Zbl 0882.05054)] that every outerplanar graph with maximum degree at most \(\Delta\) admits an equitable \(k ...
A V Kostochka
exaly +2 more sources
Pathlength of Outerplanar Graphs
Theoretical Computer Science, 2022 A path-decomposition of a graph G = (V, E) is a sequence of subsets of V , called bags, that satisfy some connectivity properties. The length of a path-decomposition of a graph G is the greatest distance between two vertices that belong to a same bag and the pathlength, denoted by pl(G), of G is the smallest length of its path-decompositions.
Dissaux, Thomas, Nisse, Nicolas
openaire +4 more sources
B0-VPG Representation of AT-free Outerplanar Graphs
Journal of Graph Algorithms and Applications, 2023 A $k$-bend path is a non-self-intersecting polyline in the plane made of at most $k+1$ axis-parallel line segments. B$_{k}$-VPG is the class of graphs which can be represented as intersection graphs of $k$-bend paths in the same plane. In this paper,
Sparsh Jain +2 more
doaj +1 more source
Splitting Plane Graphs to Outerplanarity
Journal of Graph Algorithms and Applications, 2023 Vertex splitting replaces a vertex by two copies and partitions its incident edges amongst the copies. This problem has been studied as a graph editing operation to achieve desired properties with as few splits as possible, most often planarity, for which the problem is NP-hard.Here we study how to minimize the number of splits to turn a plane graph ...
Martin Gronemann +2 more
openaire +2 more sources
Edge-group choosability of outerplanar and near-outerplanar graphs [PDF]
Transactions on Combinatorics, 2020 Let $\chi_{gl}(G)$ be the {\it{group choice number}} of $G$. A graph $G$ is called {\it{edge-$k$-group choosable}} if its line graph is $k$-group choosable. The {\it{group-choice index}} of $G$, $\chi'_{gl}(G)$, is the smallest $k$ such that $G$ is edge-$
Amir Khamseh
doaj +1 more source