Results 1 to 10 of about 3,832 (97)

Bipolar fuzzy outerplanar graphs approach in image shrinking [PDF]

Scientific 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, Sujatha Ramalingam, Nagarajan Deivanayagampillai, Tadesse Walelign   +3 more
doaj   +2 more sources

Image contraction through fuzzy soft outerplanar graph structures [PDF]

Scientific Reports
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 ...
Deivanai Jaisankar, Sujatha Ramalingam, Gizachew Bayou Zegeye   +2 more
doaj   +2 more sources

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

Scientific 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, Sujatha Ramalingam, Gizachew Bayou Zegeye   +2 more
doaj   +2 more sources

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

Scientific 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, Sujatha Ramalingam, Nagarajan Deivanayagampillai, Tadesse Walelign   +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   +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, Minati De, Abhiruk Lahiri   +2 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, Bableen Kaur, Pravin Garg, Deepa Sinha   +3 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, Anuradha V Deshpande   +1 more
doaj   +1 more source

On the spread of outerplanar graphs

Special Matrices, 2022
The spread of a graph is the difference between the largest and most negative eigenvalue of its adjacency matrix. We show that for sufficiently large nn, the nn-vertex outerplanar graph with maximum spread is a vertex joined to a linear forest with Ω(n ...
Gotshall Daniel, O’Brien Megan, Tait Michael   +2 more
doaj   +1 more source

A Characterization of Maximal Outerplanar-Open Distance Pattern Uniform Graphs

مجلة بغداد للعلوم, 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   +1 more source