2011Sci-Tech Information Development & EconomyRequires access

Discussion on the Bases of a Special Primitive Non-powerful Signed Digraph

Gao Yu-bi

Open publisher page 0 citations

Abstract

In order to know more about relative properties of the bases of the primitive non-powerful signed digraph,this paper makes the research on the bases of a special primitive non-powerful signed digraph with three cycles,obtains the upper bounds of the bases with some lemmas and definitions of the primitive non-powerful signed digraph,and by busing the proof by contradiction and connecting with distinguished cycle pair,Frobenius set and other relative knowledge,discusses whether or not there is a pair of SSSD walks in digraph,and gets the bases of the digraph.

About this research paper

What this paper is about

In order to know more about relative properties of the bases of the primitive non-powerful signed digraph,this paper makes the research on the bases of a special primitive non-powerful signed digraph with three cycles,obtains the upper bounds of the bases with some lemmas and definitions of the primitive non-powerful signed digraph,and by busing the proof by contradiction and connecting with distinguished cycle pair,Frobenius set and other relative knowledge,discusses whether or not there is a pair of SSSD walks in digraph,and gets the bases of the digraph.

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

In order to know more about relative properties of the bases of the primitive non-powerful signed digraph,this paper makes the research on the bases of a special primitive non-powerful signed digraph with three cycles,obtains the upper bounds of the bases with some lemmas and definitions of the primitive non-powerful signed digraph,and by busing the proof by contradiction and connecting with distinguished cycle pair,Frobenius set and other relative knowledge,discusses whether or not there is a pair of SSSD walks in digraph,and gets the bases of the digraph.

Key concepts: Digraph, Contradiction, Mathematics, Combinatorics, Set (abstract data type), Order (exchange), Discrete mathematics, Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
Discussion on the Bases of a Special Primitive Non-powerful Signed Digraph — Research Paper | ScholarLens