Ordering oriented bicyclic graphs with fixed diameter

چکیده مقاله

Let S(G^s ) be the skew adjacency matrix of the oriented graph G^s , which is obtained from a simple undirected graph G by assigning an orientation s to each of its edges. In this paper, we define a quasi-ordering relation ” < ” and then we order all oriented bicyclic graphs on n vertices with fixed diameter d for any positive integer d, 2 < d < n-1.