Results 1 to 10 of about 891,995 (127)
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
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 +16 more
core +3 more sources
Planar, Outerplanar, and Toroidal Graphs of the Generalized Zero-Divisor Graph of Commutative Rings
Journal of Mathematics, 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.
Abdulaziz M. Alanazi +2 more
doaj +2 more sources
Fuzzy Outerplanar Graphs and Its Applications
International Journal of Computational Intelligence SystemsThe 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 +3 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
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
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
Large Induced Acyclic and Outerplanar Subgraphs of 2-Outerplanar Graph [PDF]
Graphs and Combinatorics, 2017 Albertson and Berman conjectured that every planar graph has an induced forest on half of its vertices. The best known lower bound, due to Borodin, is that every planar graph has an induced forest on two fifths of its vertices.
G. Borradaile +2 more
semanticscholar +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