Let A be an n×n primitive Boolean matrix. γ(A) is the least number k such that A k=J. σ(A) is the number of 1 entry in A . In this paper, we consider the parameter M ′(k,n)= min {σ...Let A be an n×n primitive Boolean matrix. γ(A) is the least number k such that A k=J. σ(A) is the number of 1 entry in A . In this paper, we consider the parameter M ′(k,n)= min {σ(A)|A k=J, trace (A)=0} and obtain the values of M ′(2,n) and M ′(k,n) for k≥2n-6 . Furthermore, the characterization of solution of A 2=J with trace (A) =0 and σ(A)=3n-3 is completely determined.展开更多
This paper describes a broad perspective of the application of graph theory to establishment of GPS control networks whereby the GPS network is considered as a connected and directed graph with three components.In thi...This paper describes a broad perspective of the application of graph theory to establishment of GPS control networks whereby the GPS network is considered as a connected and directed graph with three components.In this algorithm the gross error detection is undertaken through loops of different spanning trees using the "Loop Law" in which the individual components Δ X, Δ Y and Δ Z sum up to zero.If the sum of the respective vector components ∑X,∑Y and ∑Z in a loop is not zero and if the error is beyond the tolerable limit (ε>w),it indicates the existence of gross errors in one of the baselines in the loop and therefore the baseline must be removed or re_observed.After successful screening of errors by graph theory,network adjustment can be carried out.In this paper,the GPS data from the control network established as reference system for the HP Dam at Baishan county in Liaoning province is presented to illustrate the algorithm.展开更多
Recently,scrambling index and competition index are widely applied to stochastic matrices and food webs. By analyzing the relationship of scrambling index and 2-competition index,n-「d/2」+ 1 was proved to be an upper...Recently,scrambling index and competition index are widely applied to stochastic matrices and food webs. By analyzing the relationship of scrambling index and 2-competition index,n-「d/2」+ 1 was proved to be an upper bound of the 2-competition2 index of a primitive digraph with exact d loops in this article.Moreover,the maximum index problem and the index set problem for the 2-competition index of primitive digraphs with minimally strong digraphs were settled.展开更多
A matrix whose entries are +,-, and 0 is called a sign pattern matrix. Let k be arbitrary positive integer. We first characterize sign patterns A such that .Ak≤0. Further, we determine the maximum number of negative ...A matrix whose entries are +,-, and 0 is called a sign pattern matrix. Let k be arbitrary positive integer. We first characterize sign patterns A such that .Ak≤0. Further, we determine the maximum number of negative entries that can occur in A whenever Ak≤0. Finally, we give a necessity and sufficiency condition for A2≤0.展开更多
文摘Let A be an n×n primitive Boolean matrix. γ(A) is the least number k such that A k=J. σ(A) is the number of 1 entry in A . In this paper, we consider the parameter M ′(k,n)= min {σ(A)|A k=J, trace (A)=0} and obtain the values of M ′(2,n) and M ′(k,n) for k≥2n-6 . Furthermore, the characterization of solution of A 2=J with trace (A) =0 and σ(A)=3n-3 is completely determined.
文摘This paper describes a broad perspective of the application of graph theory to establishment of GPS control networks whereby the GPS network is considered as a connected and directed graph with three components.In this algorithm the gross error detection is undertaken through loops of different spanning trees using the "Loop Law" in which the individual components Δ X, Δ Y and Δ Z sum up to zero.If the sum of the respective vector components ∑X,∑Y and ∑Z in a loop is not zero and if the error is beyond the tolerable limit (ε>w),it indicates the existence of gross errors in one of the baselines in the loop and therefore the baseline must be removed or re_observed.After successful screening of errors by graph theory,network adjustment can be carried out.In this paper,the GPS data from the control network established as reference system for the HP Dam at Baishan county in Liaoning province is presented to illustrate the algorithm.
基金National Natural Science Foundations of China(No.11272100,No.50865001)
文摘Recently,scrambling index and competition index are widely applied to stochastic matrices and food webs. By analyzing the relationship of scrambling index and 2-competition index,n-「d/2」+ 1 was proved to be an upper bound of the 2-competition2 index of a primitive digraph with exact d loops in this article.Moreover,the maximum index problem and the index set problem for the 2-competition index of primitive digraphs with minimally strong digraphs were settled.
基金Supported by Shanxi Natural Science Foundation(20011006)
文摘A matrix whose entries are +,-, and 0 is called a sign pattern matrix. Let k be arbitrary positive integer. We first characterize sign patterns A such that .Ak≤0. Further, we determine the maximum number of negative entries that can occur in A whenever Ak≤0. Finally, we give a necessity and sufficiency condition for A2≤0.
