Paper Info
Title
On the forced unilateral orientation number of a graph
Abstract
A graph has a unilateral orientation if its edges can be oriented such that for every two vertices u and v there exists either a path from u to v or a path from v to u . If G is a graph with a unilateral orientation, then the forced unilateral orientation number of G is defined to be the minimum cardinality of a subset of the set of edges for which there is an assignment of directions that has a unique extension to a unilateral orientation of G . This paper gives a general lower bound for the forced unilateral orientation number and shows that the unilateral orientation number of a graph of size m , order n , and having edge connectivity 1 is equal to m − n + 2. A few other related problems are discussed.
Year
DOI
Venue
1998
10.1016/S0012-365X(97)00233-1
Discrete Mathematics
Keywords
Field
DocType
unilateral orientation number,lower bound
Discrete mathematics,Graph,Combinatorics,Existential quantification,Vertex (geometry),Bound graph,Upper and lower bounds,Cycle graph,Cardinality,Mathematics,Path graph
Journal
Volume
Issue
ISSN
187
1-3
Discrete Mathematics
Citations 
PageRank 
References 
1
0.42
0
Authors
1
Name
Order
Citations
PageRank
Dana Pascovici110.76