Results 1 to 10 of about 4,003 (201)

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

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

On k-edge-magic labelings of maximal outerplanar graphs [PDF]

AKCE International Journal of Graphs and Combinatorics, 2015
Let G be a graph with vertex set V and edge set E such that |V|=p and |E|=q. We denote this graph by (p,q)-graph. For integers k≥0, define a one-to-one map f from E to {k,k+1,…,k+q−1} and define the vertex sum for a vertex v as the sum of the labels of ...
Gee-Choon Lau, Saeid Alikhani, Sin-Min Lee, William Kocay   +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   +3 more sources

A Universal Point Set for 2-Outerplanar Graphs

, 2015
A point set $S \subseteq \mathbb{R}^2$ is universal for a class $\cal G$ if every graph of ${\cal G}$ has a planar straight-line embedding on $S$. It is well-known that the integer grid is a quadratic-size universal point set for planar graphs, while the
Patrizio Angelini, Till Bruckdorfer, Michael Kaufmann, Tamara Mchedlidze   +3 more
openalex   +4 more sources

An O(mn2) Algorithm for Computing the Strong Geodetic Number in Outerplanar Graphs

Discussiones Mathematicae Graph Theory, 2022
Let G = (V (G), E(G)) be a graph and S be a subset of vertices of G. Let us denote by γ[u, v] a geodesic between u and v. Let Γ(S) = {γ[vi, vj] | vi, vj ∈ S} be a set of exactly |S|(|S|−1)/2 geodesics, one for each pair of distinct vertices in S.
Mezzini Mauro
doaj   +2 more sources

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

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

Double domination in maximal outerplanar graphs

Open Mathematics, 2022
In graph GG, a vertex dominates itself and its neighbors. A subset S⊆V(G)S\subseteq V\left(G) is said to be a double-dominating set of GG if SS dominates every vertex of GG at least twice.
Zhuang Wei, Zheng Qiuju
doaj   +1 more source