Results 1 to 10 of about 3,997 (179)
Outerplanar graph drawings with few slopes [PDF]
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.
Kolja Knauer +2 more
exaly +9 more sources
The Singularity of Oriented Outerplanar Graphs with a Given Number of Inner Edges
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 AD is nonsingular (singular).
Borui He, Xianya Geng, Long Wang
doaj +2 more sources
Edge-group choosability of outerplanar and near-outerplanar graphs [PDF]
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
Image contraction through fuzzy soft outerplanar graph structures [PDF]
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 +2 more
doaj +2 more sources
Bipolar fuzzy outerplanar graphs approach in image shrinking [PDF]
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 +2 more sources
A fuzzy graph theoretic approach to face shape recognition using cubic outerplanar structures [PDF]
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]
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
Planar, Outerplanar, and Toroidal Graphs of the Generalized Zero-Divisor Graph of Commutative Rings
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.
Abdulaziz M. Alanazi +2 more
doaj +2 more sources
Pathlength of Outerplanar Graphs
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
Circular Separation Dimension of a Subclass of Planar Graphs [PDF]
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

