Results 11 to 20 of about 63,549 (264)
Oriented bipartite graphs and the Goldbach graph [PDF]
Discrete Mathematics, 2021 In this paper, we study oriented bipartite graphs. In particular, we introduce "bitransitive" graphs. Several characterizations of bitransitive bitournaments are obtained. We show that bitransitive bitounaments are equivalent to acyclic bitournaments. As applications, we characterize acyclic bitournaments with Hamiltonian paths, determine number of non-
Sandip Das, Shamik Ghosh, Sagnik Sen
exaly +3 more sources
Oriented Flip Graphs and Noncrossing Tree Partitions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Given a tree embedded in a disk, we define two lattices - the oriented flip graph of noncrossing arcs and the lattice of noncrossing tree partitions.
Alexander Garver, Thomas McConville
doaj +1 more source
The Existence of Planar Hypotraceable Oriented Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 A digraph is \emph{traceable} if it has a path that visits every vertex. A digraph $D$ is \emph{hypotraceable} if $D$ is not traceable but $D-v$ is traceable for every vertex $v\in V(D)$.
Susan van Aardt +2 more
doaj +1 more source
Strong oriented chromatic number of planar graphs without short cycles [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Let M be an additive abelian group. A strong oriented coloringof an oriented graph G is a mapping φ from V(G) to M such that (1) φ(u) ≠ φ(v) whenever uv is an arc in G and (2) φ(v) - φ(u) ≠ -(φ(t) - φ(z)) whenever uv and zt are two arcs in
Mickaël Montassier +2 more
doaj +2 more sources
List-antimagic labeling of vertex-weighted graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 A graph $G$ is $k$-$weighted-list-antimagic$ if for any vertex weighting $\omega\colon V(G)\to\mathbb{R}$ and any list assignment $L\colon E(G)\to2^{\mathbb{R}}$ with $|L(e)|\geq |E(G)|+k$ there exists an edge labeling $f$ such that $f(e)\in L(e)$ for ...
Zhanar Berikkyzy +4 more
doaj +1 more source
Discrete Mathematics, 2023 Fixed an accidental omission in Problem ...
Tereza Klimosová, Maya Stein
openaire +3 more sources
Decomposing Oriented Graphs into Six Locally Irregular Oriented Graphs [PDF]
Graphs and Combinatorics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Julien Bensmail, Gabriel Renault
openaire +1 more source
New skew equienergetic oriented graphs [PDF]
Communications in Combinatorics and Optimization, 2019 Let $S(G^{\sigma})$ be the skew-adjacency matrix of the oriented graph $G^{\sigma}$, which is obtained from a simple undirected graph $G$ by assigning an orientation $\sigma$ to each of its edges.
X. Liu, L. Wang, C. Duan
doaj +1 more source
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 +1 more source
Taiwanese Journal of Mathematics, 2023 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Zhenzhen +2 more
openaire +2 more sources