## 抄録

Let G be any directed graph and S be nonnegative and non-decreasing integer sequence(s). The prescribed degree sequence problem is a problem to determine whether there is a graph G with S as the prescribed sequence(s) of outdegrees of the vertices. Let G be the property satisfying the following (1) and (2): (1) G has two disjoint vertex sets A and B. (2) For every vertex pair u, v∈ G (u ≠ v), G satisfies |{HV}| + |{VH}|= {r_{11} if u, v∈ A {r _{12} if u∈ A, v∈ B {r_{22} if u, v ∈ B, where uv (vu, respectively) means a directed edges from u to v (from v to u). Then G is called an (r_{11},r_{12},r_{22})-tournament ("tournament", for short). When G is a "tournament," the prescribed degree sequence problem is called the score sequence pair problem of a "tournament", and S is called a score sequence pair of a "tournament" (or S is realizable) if the answer is "yes." In this paper, we propose the characterizations of a "tournament" and an algorithm for determining in linear time whether a pair of two integer sequences is realizable or not.

本文言語 | English |
---|---|

ホスト出版物のタイトル | APCCAS 2006 - 2006 IEEE Asia Pacific Conference on Circuits and Systems |

ページ | 1019-1022 |

ページ数 | 4 |

DOI | |

出版ステータス | Published - 2006 |

外部発表 | はい |

イベント | APCCAS 2006 - 2006 IEEE Asia Pacific Conference on Circuits and Systems - , Singapore 継続期間: 2006 12月 4 → 2006 12月 6 |

### 出版物シリーズ

名前 | IEEE Asia-Pacific Conference on Circuits and Systems, Proceedings, APCCAS |
---|

### Conference

Conference | APCCAS 2006 - 2006 IEEE Asia Pacific Conference on Circuits and Systems |
---|---|

国/地域 | Singapore |

Period | 06/12/4 → 06/12/6 |

## ASJC Scopus subject areas

- 電子工学および電気工学

## フィンガープリント

「Realizability of Score sequence pair of an (r_{11}, r

_{12}, r

_{22})-tournament」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。