Results 1 to 10 of about 231 (167)
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
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 +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 +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
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
Circular Separation Dimension of a Subclass of Planar Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 A pair of non-adjacent edges is said to be separated in a circular ordering of vertices, if the endpoints of the two edges do not alternate in the ordering.
Arpitha P. Bharathi +2 more
doaj +1 more source
On the planarity of line Mycielskian graph of a graph
Ratio Mathematica, 2020 The line Mycielskian graph of a graph G, denoted by Lμ(G) is defined as the graph obtained from L(G) by adding q+1 new vertices E' = ei' : 1 ≤ i ≤ q and e, then for 1 ≤ i ≤ q , joining ei' to the neighbours of ei and to e.
Keerthi G. Mirajkar +1 more
doaj +1 more source
On Another Class of Strongly Perfect Graphs
Mathematics, 2022 For a commutative ring R with unity, the associate ring graph, denoted by AG(R), is a simple graph with vertices as nonzero elements of R and two distinct vertices are adjacent if they are associates.
Neha Kansal +3 more
doaj +1 more source
Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid
Journal of Graph Algorithms and Applications, 2022 In a representation of a graph $G$ as an edge intersection graph of paths on a grid (EPG) every vertex of $G$ is represented by a path on a grid and two paths share a grid edge iff the corresponding vertices are adjacent.
Eranda Çela, Elisabeth Gaar
doaj +1 more source