2004•Journal of Shanxi UniversityRequires access

Pancyclic Out-arcs of A Vertex in Local Round-decomposable Tournament

Shengjia Li

Open publisher page 0 citations

Abstract

Yao Tianxing (Discrete Appl.Math.,2000,99:245-249)has proved that every strong tournament contains a vertex v such that each arc going out from the vertex is pancyclic.In this paper,the result is extended to strong round-decomposable proper local tournament and prove that a strong local tournament D,which is round-decomposable and the round decomposition D=R[D_1,D_2,...,D_α],D_i is strong tournament,containing a vertex v such that every arc going out from v is (g+1)-panaydic,where g={l(Ca)|Ca is the longest induced cycle containing a,a∈V(R),where l(Ca) is the length of Ca}.

About this research paper

What this paper is about

Yao Tianxing (Discrete Appl.Math.,2000,99:245-249)has proved that every strong tournament contains a vertex v such that each arc going out from the vertex is pancyclic.In this paper,the result is extended to strong round-decomposable proper local tournament and prove that a strong local tournament D,which is round-decomposable and the round decomposition D=R[D_1,D_2,...,D_α],D_i is strong tournament,containing a vertex v such that every arc going out from v is (g+1)-panaydic,where g={l(Ca)|Ca is the longest induced cycle containing a,a∈V(R),where l(Ca) is the length of Ca}.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Yao Tianxing (Discrete Appl.Math.,2000,99:245-249)has proved that every strong tournament contains a vertex v such that each arc going out from the vertex is pancyclic.In this paper,the result is extended to strong round-decomposable proper local tournament and prove that a strong local tournament D,which is round-decomposable and the round decomposition D=R[D_1,D_2,...,D_α],D_i is strong tournament,containing a vertex v such that every arc going out from v is (g+1)-panaydic,where g={l(Ca)|Ca is the longest induced cycle containing a,a∈V(R),where l(Ca) is the length of Ca}.

Key concepts: Tournament, Vertex (graph theory), Combinatorics, Mathematics, Arc (geometry), Discrete mathematics, Geometry, Graph

Related papers

Back to paper searchBrowse research topicsOriginal source
Pancyclic Out-arcs of A Vertex in Local Round-decomposable Tournament — Research Paper | ScholarLens