GraphTheory - Maple Programming Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Mathematics : Discrete Mathematics : Graph Theory : GraphTheory Package : GraphTheory/IsTournament

GraphTheory

  

IsTournament

 

Calling Sequence

Parameters

Description

Examples

Calling Sequence

IsTournament(G)

Parameters

G

-

graph

Description

• 

IsTournament returns true if the input graph is a tournament. It returns false otherwise.

• 

A tournament is a directed graph G that satisfies the following property: for every pair of vertices u and v in G exactly one of the directed edges u,v or v,u is in G.

Examples

withGraphTheory:

T1Digraph1,2,2,3,3,1

T1Graph 1: a directed unweighted graph with 3 vertices and 3 arc(s)

(1)

IsTournamentT1

true

(2)

T2Digraph1,2,1,3,2,3,3,1

T2Graph 2: a directed unweighted graph with 3 vertices and 4 arc(s)

(3)

IsTournamentT2

false

(4)

T3Digraph1,2,2,3

T3Graph 3: a directed unweighted graph with 3 vertices and 2 arc(s)

(5)

IsTournamentT3

false

(6)

See Also

AdjacencyMatrix

HasEdge

RandomGraphs[RandomTournament]