Score sequence pair problems of (r11, r12, r 22)-tournaments - Determination of realizability

Masaya Takahashi, Takahiro Watanabe, Takeshi Yoshimura

Research output: Contribution to journalArticle

Abstract

Let G be any graph with property P (for example, general graph, directed graph, etc.) 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 having S as the prescribed sequence(s) of degrees or outdegrees of the vertices. From 1950's, P has attracted wide attentions, and its many extensions have been considered. Let P be the property satisfying the following (1) and (2): G is a directed graph with two disjoint vertex sets A and B. There are r11 (r22, respectively) directed edges between every pair of vertices in A(B), and r12 directed edges between every pair of vertex in A and vertex in B. Then G is called an (r11, r 12, r22) -tournament ("tournament", for short). The problem is called the score sequence pair problem of a " tournament" (realizable, for short). S is called a score sequence pair of a "tournament" if the answer of the problem is "yes." In this paper, we propose the characterizations of a score sequence pair of a "tournament" and an algorithm for determining in linear time whether a pair of two integer sequences is realizable or not.

Original languageEnglish
Pages (from-to)440-447
Number of pages8
JournalIEICE Transactions on Information and Systems
VolumeE90-D
Issue number2
DOIs
Publication statusPublished - 2007 Feb

Fingerprint

Directed graphs

Keywords

  • Algorithm
  • Graph theory
  • Prescribed degrees
  • Score sequence
  • Tournament

ASJC Scopus subject areas

  • Information Systems
  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

Score sequence pair problems of (r11, r12, r 22)-tournaments - Determination of realizability. / Takahashi, Masaya; Watanabe, Takahiro; Yoshimura, Takeshi.

In: IEICE Transactions on Information and Systems, Vol. E90-D, No. 2, 02.2007, p. 440-447.

Research output: Contribution to journalArticle

@article{168dcb3eb1c648d8a23fa99f67450a2f,
title = "Score sequence pair problems of (r11, r12, r 22)-tournaments - Determination of realizability",
abstract = "Let G be any graph with property P (for example, general graph, directed graph, etc.) 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 having S as the prescribed sequence(s) of degrees or outdegrees of the vertices. From 1950's, P has attracted wide attentions, and its many extensions have been considered. Let P be the property satisfying the following (1) and (2): G is a directed graph with two disjoint vertex sets A and B. There are r11 (r22, respectively) directed edges between every pair of vertices in A(B), and r12 directed edges between every pair of vertex in A and vertex in B. Then G is called an (r11, r 12, r22) -tournament ({"}tournament{"}, for short). The problem is called the score sequence pair problem of a {"} tournament{"} (realizable, for short). S is called a score sequence pair of a {"}tournament{"} if the answer of the problem is {"}yes.{"} In this paper, we propose the characterizations of a score sequence pair of a {"}tournament{"} and an algorithm for determining in linear time whether a pair of two integer sequences is realizable or not.",
keywords = "Algorithm, Graph theory, Prescribed degrees, Score sequence, Tournament",
author = "Masaya Takahashi and Takahiro Watanabe and Takeshi Yoshimura",
year = "2007",
month = "2",
doi = "10.1093/ietisy/e90-d.2.440",
language = "English",
volume = "E90-D",
pages = "440--447",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "2",

}

TY - JOUR

T1 - Score sequence pair problems of (r11, r12, r 22)-tournaments - Determination of realizability

AU - Takahashi, Masaya

AU - Watanabe, Takahiro

AU - Yoshimura, Takeshi

PY - 2007/2

Y1 - 2007/2

N2 - Let G be any graph with property P (for example, general graph, directed graph, etc.) 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 having S as the prescribed sequence(s) of degrees or outdegrees of the vertices. From 1950's, P has attracted wide attentions, and its many extensions have been considered. Let P be the property satisfying the following (1) and (2): G is a directed graph with two disjoint vertex sets A and B. There are r11 (r22, respectively) directed edges between every pair of vertices in A(B), and r12 directed edges between every pair of vertex in A and vertex in B. Then G is called an (r11, r 12, r22) -tournament ("tournament", for short). The problem is called the score sequence pair problem of a " tournament" (realizable, for short). S is called a score sequence pair of a "tournament" if the answer of the problem is "yes." In this paper, we propose the characterizations of a score sequence pair of a "tournament" and an algorithm for determining in linear time whether a pair of two integer sequences is realizable or not.

AB - Let G be any graph with property P (for example, general graph, directed graph, etc.) 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 having S as the prescribed sequence(s) of degrees or outdegrees of the vertices. From 1950's, P has attracted wide attentions, and its many extensions have been considered. Let P be the property satisfying the following (1) and (2): G is a directed graph with two disjoint vertex sets A and B. There are r11 (r22, respectively) directed edges between every pair of vertices in A(B), and r12 directed edges between every pair of vertex in A and vertex in B. Then G is called an (r11, r 12, r22) -tournament ("tournament", for short). The problem is called the score sequence pair problem of a " tournament" (realizable, for short). S is called a score sequence pair of a "tournament" if the answer of the problem is "yes." In this paper, we propose the characterizations of a score sequence pair of a "tournament" and an algorithm for determining in linear time whether a pair of two integer sequences is realizable or not.

KW - Algorithm

KW - Graph theory

KW - Prescribed degrees

KW - Score sequence

KW - Tournament

UR - http://www.scopus.com/inward/record.url?scp=33847163956&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33847163956&partnerID=8YFLogxK

U2 - 10.1093/ietisy/e90-d.2.440

DO - 10.1093/ietisy/e90-d.2.440

M3 - Article

AN - SCOPUS:33847163956

VL - E90-D

SP - 440

EP - 447

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 2

ER -