Results 1 to 10 of about 119,166 (199)
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
On the outerplanar crossing numbers of complete multipartite graphs [PDF]
arXiv, 2006 We calculate the outerplanar crossing numbers of complete multipartite graphs which have $n$ partite sets with $m$ vertices and one partite set with $p$ vertices, where either $p|mn$ or $mn|p$.
Adrian Riskin
arxiv +3 more sources
A note on the incidence coloring of outerplanar graphs [PDF]
arXiv, 2007 A proof that every outerplanar graph is \Delta+2 colorable. This is slightly stronger then an unpublished result of Wang Shudong, Ma Fangfang, Xu Jin, and Yan Lijun proving the same for 2-connected outerplanar graphs.
Maksim Maydanskiy
arxiv +3 more sources
Edge covering pseudo-outerplanar graphs with forests [PDF]
arXiv, 2011 A graph is called pseudo-outerplanar if each block has an embedding on the plane in such a way that the vertices lie on a fixed circle and the edges lie inside the disk of this circle with each of them crossing at most one another. In this paper, we prove that each pseudo-outerplanar graph admits edge decompositions into a linear forest and an ...
Xin Zhang, Guizhen Liu, Jianliang Wu
arxiv +3 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 +3 more
doaj +2 more sources
Independent sets versus 4-dominating sets in outerplanar graphs [PDF]
arXiv, 2023 We show that the number of independent sets in every outerplanar graph is greater than the number of its 4-dominating sets.
Dmitrii Taletskii
arxiv +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
Geometric assortative growth model for small-world networks. [PDF]
ScientificWorldJournal, 2014 It has been shown that both humanly constructed and natural networks are often characterized by small‐world phenomenon and assortative mixing. In this paper, we propose a geometrically growing model for small‐world networks. The model displays both tunable small‐world phenomenon and tunable assortativity.
Shang Y.
europepmc +2 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
The 2-center Problem in Maximal Outerplanar Graph [PDF]
arXiv, 2022 We consider the problem of computing 2-center in maximal outerplanar graph. In this problem, we want to find an optimal solution where two centers cover all the vertices with the smallest radius. We provide the following result. We can compute the optimal centers and the optimal radius in $O(n^2)$ time for a given maximal outerplanar graph with $n ...
Hsiu-Fu Yeh
arxiv +3 more sources