Results 11 to 20 of about 886,125 (210)

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, Mohd Nazim, Nadeem Ur Rehman   +2 more
doaj   +3 more sources

The Singularity of Oriented Outerplanar Graphs with a Given Number of Inner Edges

Journal of Mathematics, 2022
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]

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

Fuzzy Outerplanar Graphs and Its Applications

International Journal of Computational Intelligence Systems
The 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, Sujatha Ramalingam, Nagarajan Deivanayagampillai, Tadesse Walelign   +3 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

Odd 4-Coloring of Outerplanar Graphs

Graphs and Combinatorics
A proper k-coloring of G is called an odd coloring of G if for every vertex v, there is a color that appears at an odd number of neighbors of v. This concept was introduced recently by Petruševski and Škrekovski, and they conjectured that every planar ...
Masaki Kashima, Xuding Zhu
semanticscholar   +3 more sources

Matching Complexes of Outerplanar Graphs [PDF]

An outerplanar graph is a planar graph that has a planar drawing with all vertices on the unbounded face. The matching complex of a graph is the simplicial complex whose faces are subsets of disjoint edges of the graph. In this paper we prove that the matching complexes of outerplanar graphs are contractible or homotopy equivalent to a wedge of spheres.
Margaret M. Bayer, Marija Jelić Milutinović, Julianne Vega   +2 more
openalex   +3 more sources

Metric Dimension of Maximal Outerplanar Graphs [PDF]

Bulletin of the Malaysian Mathematical Sciences Society, 2021
25 pages, 16 ...
M. Claverol, A. García, G. Hernández, C. Hernando, M. Maureso, M. Mora, J. Tejel   +6 more
openaire   +4 more sources

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 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