A semi-proper orientation is a weighted orientation such that for every two adjacent vertices and , S ( D , w ) ( v ) ≠ S ( D , w ) ( u ) , where S ( D , w ) ( x ) is the sum of the weights of arcs with head in .
Jun 15, 2021
Jun 15, 2021 · A semi-proper orientation is a weighted orientation such that two adjacent vertices have different in-weights. The semi-proper orientation ...
May 8, 2019 · Finally, we prove that the problem of determining the semi-proper orientation number of planar bipartite graphs is NP-hard. Subjects: Discrete ...
Dec 2, 2020 · Abstract. A weighted orientation of a graph G is a pair (D, w) where D is an orientation of G and w is an arc-weighting of D, ...
Sep 7, 2024 · Finally, we prove that the problem of determining the semi-proper orientation number of planar bipartite graphs is NP-hard.
Proper orientation, proper biorientation and semi-proper orientation numbers of graphs · Mathematics. Journal of Combinatorial Optimization · 2022.
A semi-proper orientation is a weighted orientation such that two adjacent vertices have different in-weights. The semi-proper orientation number of a graph G, ...
Apr 15, 2020 · A semi-proper orientation of a given graph G, denoted by (D,w), is an orientation D with a weight function w: A(D)\rightarrow \mathbb{Z}_+, such ...
People also ask
What is the orientation of a graph?
Dec 27, 2022 · A semi-proper p-orientation (D, w) of an undirected graph G is an orientation D of G together with a weight function w : A ( D ) → Z + , such ...
Missing: orientations | Show results with:orientations
Jul 13, 2022 · The semi-proper orientation number spon(G) of a graph G is the minimum p such that G has a semi-proper p-orientation (D, w) of G. This parameter ...