Bases of a primitive non-powerful signed digraph
Yubin Gao
Abstract
Yubin Gao
Abstract
In order to further understand characteristics and properties of the bases of primitive non-powerful signed digraph,a primitive non-powerful signed digraph with three cycles are studied in this work.By analyzing the features of the digraph in which there are two cycles that have equal lengths,using apagoge and knowledge about primitive exponents,point exponents,Bases,Frobenius set,powerful,non-powerful and distinguished cycle pair,assuming that the two cycles which have equal lengths have the same and different signs and discussing SSSD walks,the equal upper and lower bounds of bases are obtained,then the true values of bases are got.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In order to further understand characteristics and properties of the bases of primitive non-powerful signed digraph,a primitive non-powerful signed digraph with three cycles are studied in this work.By analyzing the features of the digraph in which there are two cycles that have equal lengths,using apagoge and knowledge about primitive exponents,point exponents,Bases,Frobenius set,powerful,non-powerful and distinguished cycle pair,assuming that the two cycles which have equal lengths have the same and different signs and discussing SSSD walks,the equal upper and lower bounds of bases are obtained,then the true values of bases are got.
Key concepts: Digraph, Mathematics, Combinatorics, Set (abstract data type), Point (geometry), Upper and lower bounds, Order (exchange), Discrete mathematics