In this study,the problem of bundle adjustment was revisited,and a novel algorithm based on block matrix Cholesky decomposition was proposed to solve the thorny problem of self-calibration bundle adjustment.The innova...In this study,the problem of bundle adjustment was revisited,and a novel algorithm based on block matrix Cholesky decomposition was proposed to solve the thorny problem of self-calibration bundle adjustment.The innovation points are reflected in the following aspects:①The proposed algorithm is not dependent on the Schur complement,and the calculation process is simple and clear;②The complexities of time and space tend to O(n)in the context of world point number is far greater than that of images and cameras,so the calculation magnitude and memory consumption can be reduced significantly;③The proposed algorithm can carry out self-calibration bundle adjustment in single-camera,multi-camera,and variable-camera modes;④Some measures are employed to improve the optimization effects.Experimental tests showed that the proposed algorithm has the ability to achieve state-of-the-art performance in accuracy and robustness,and it has a strong adaptability as well,because the optimized results are accurate and robust even if the initial values have large deviations from the truth.This study could provide theoretical guidance and technical support for the image-based positioning and 3D reconstruction in the fields of photogrammetry,computer vision and robotics.展开更多
We demonstrate that, when computing the LDU decomposition (a typical example of a direct solution method), it is possible to obtain the derivative of a determinant with respect to an eigenvalue of a non-symmetric matr...We demonstrate that, when computing the LDU decomposition (a typical example of a direct solution method), it is possible to obtain the derivative of a determinant with respect to an eigenvalue of a non-symmetric matrix. Our proposed method augments an LDU decomposition program with an additional routine to obtain a program for easily evaluating the derivative of a determinant with respect to an eigenvalue. The proposed method follows simply from the process of solving simultaneous linear equations and is particularly effective for band matrices, for which memory requirements are significantly reduced compared to those for dense matrices. We discuss the theory underlying our proposed method and present detailed algorithms for implementing it.展开更多
An efficient and stable structure preserving algorithm, which is a variant of the QR like (SR) algorithm due to Bunse-Gerstner and Mehrmann, is presented for computing the eigenvalues and stable invariant subspaces of...An efficient and stable structure preserving algorithm, which is a variant of the QR like (SR) algorithm due to Bunse-Gerstner and Mehrmann, is presented for computing the eigenvalues and stable invariant subspaces of a Hamiltonian matrix. In the algorithm two strategies are employed, one of which is called dis-unstabilization technique and the other is preprocessing technique. Together with them, a so-called ratio-reduction equation and a backtrack technique are introduced to avoid the instability and breakdown in the original algorithm. It is shown that the new algorithm can overcome the instability and breakdown at low cost. Numerical results have demonstrated that the algorithm is stable and can compute the eigenvalues to very high accuracy.展开更多
We construct one multi-sender authentication code by algebraic combination method from eigenvalues and eigenvectors of the matrix over nite elds. Some parameters and the probabilities of three kinds of successful atta...We construct one multi-sender authentication code by algebraic combination method from eigenvalues and eigenvectors of the matrix over nite elds. Some parameters and the probabilities of three kinds of successful attack of this code are also computed. For multi-sender authentication code,it allows a group of senders to construct an authenticated message for a receiver such that the receiver can verify authenticity of the received message.展开更多
A detailed procedure based on an analytical transfer matrix method is presented to solve bound-state problems. The derivation is strict and complete. The energy eigenvalues for an arbitrary one-dimensional potential c...A detailed procedure based on an analytical transfer matrix method is presented to solve bound-state problems. The derivation is strict and complete. The energy eigenvalues for an arbitrary one-dimensional potential can be obtained by the method. The anharmonic oscillator potential and the rational potential are two important examples. Checked by numerical techniques, the results for the two potentials by the present method are proven to be exact and reliable.展开更多
A new matrix perturbation analysis method is presented for efficient approximate solution of the complex modal quadratic generalized eigenvalue problem of viscously damped linear vibration systems. First, the damping ...A new matrix perturbation analysis method is presented for efficient approximate solution of the complex modal quadratic generalized eigenvalue problem of viscously damped linear vibration systems. First, the damping matrix is decomposed into the sum of a proportional-and a nonproportional-damping parts, and the solutions of the real modal eigenproblem with the proportional dampings are determined, which are a set of initial approximate solutions of the complex modal eigenproblem. Second, by taking the nonproportional-damping part as a small modification to the proportional one and using the matrix perturbation analysis method, a set of approximate solutions of the complex modal eigenvalue problem can be obtained analytically. The result is quite simple. The new method is applicable to the systems with viscous dampings-which do not deviate far away from the proportional-damping case. It is particularly important that the solution technique be also effective to the systems with heavy, but not over, dampings. The solution formulas of complex modal eigenvlaues and eigenvectors are derived up to second-order perturbation terms. The effectiveness of the perturbation algorithm is illustrated by an exemplar numerical problem with heavy dampings. In addition, the practicability of approximately estimating the complex modal eigenvalues, under the proportional-damping hypothesis, of damped vibration systems is discussed by several numerical examples.展开更多
A matrix eigenvalue method is applied to analyse the thermodynamic stability of two-component interacting fermions. The non-relativistic and ultra-relativistic d = 1, 2, 3 dimensions have been discussed in detail, res...A matrix eigenvalue method is applied to analyse the thermodynamic stability of two-component interacting fermions. The non-relativistic and ultra-relativistic d = 1, 2, 3 dimensions have been discussed in detail, respectively. The corresponding stability region has been given according to the two-body interaction strength and the particle number density ratio.展开更多
The paper contains two parts. First, by applying the results about the eigenvalue perturbation bounds for Hermitian block tridiagonal matrices in paper [1], we obtain a new efficient method to estimate the perturbatio...The paper contains two parts. First, by applying the results about the eigenvalue perturbation bounds for Hermitian block tridiagonal matrices in paper [1], we obtain a new efficient method to estimate the perturbation bounds for singular values of block tridiagonal matrix. Second, we consider the perturbation bounds for eigenvalues of Hermitian matrix with block tridiagonal structure when its two adjacent blocks are perturbed simultaneously. In this case, when the eigenvalues of the perturbed matrix are well-separated from the spectrum of the diagonal blocks, our eigenvalues perturbation bounds are very sharp. The numerical examples illustrate the efficiency of our methods.展开更多
An improved modal truncation method with arbitrarily high order accuracy is developed for calculating the second- and third-order eigenvalue derivatives and the first- and second-order eigenvector derivatives of an as...An improved modal truncation method with arbitrarily high order accuracy is developed for calculating the second- and third-order eigenvalue derivatives and the first- and second-order eigenvector derivatives of an asymmetric and non-defective matrix with repeated eigenvalues. If the different eigenvalues λ1, λ2,……, λs of the matrix satisfy ｜λ1｜ ≤... ≤｜λr｜ and ｜λs｜ 〈｜〈s＋1｜ （s ≤r-l）, then associated with any eigenvalue λi （i≤ s）, the errors of the eigenvalue and eigenvector derivatives obtained by the qth-order approximate method are proportional to ｜λi｜/λs＋1｜q＋l, where the approximate method only uses the eigenpairs corresponding to λ1, λ2,……,λs A numerical example shows the validity of the approximate method. The numerical example also shows that in order to get the approximate solutions with the same order accuracy, a higher order method should be used for higher order eigenvalue and eigenvector derivatives.展开更多
A new approach that bounds the largest eigenvalue of 3 × 3 correlation matrices is presented. Optimal bounds by given determinant and trace of the squared correlation matrix are derived and shown to be more strin...A new approach that bounds the largest eigenvalue of 3 × 3 correlation matrices is presented. Optimal bounds by given determinant and trace of the squared correlation matrix are derived and shown to be more stringent than the optimal bounds by Wolkowicz and Styan in specific cases.展开更多
In this paper, we present a method how to get the expression for the group inverse of 2×2 block matrix and get the explicit expressions of the block matrix (A C B D) under some conditions.
Cloud computing provides powerful processing capabilities for large-scale intelligent Internet of things(IoT)terminals.However,the massive realtime data processing requirements challenge the existing cloud computing m...Cloud computing provides powerful processing capabilities for large-scale intelligent Internet of things(IoT)terminals.However,the massive realtime data processing requirements challenge the existing cloud computing model.The edge server is closer to the data source.The end-edge-cloud collaboration offloads the cloud computing tasks to the edge environment,which solves the shortcomings of the cloud in resource storage,computing performance,and energy consumption.IoT terminals and sensors have caused security and privacy challenges due to resource constraints and exponential growth.As the key technology of IoT,Radio-Frequency Identification(RFID)authentication protocol tremendously strengthens privacy protection and improves IoT security.However,it inevitably increases system overhead while improving security,which is a major blow to low-cost RFID tags.The existing RFID authentication protocols are difficult to balance overhead and security.This paper designs an ultra-lightweight encryption function and proposes an RFID authentication scheme based on this function for the end-edge-cloud collaborative environment.The BAN logic proof and protocol verification tools AVISPA formally verify the protocol’s security.We use VIVADO to implement the encryption function and tag’s overhead on the FPGA platform.Performance evaluation indicates that the proposed protocol balances low computing costs and high-security requirements.展开更多
In order to alleviate the shortcomings of most blind deconvolution algorithms,this paper proposes an improved fast algorithm for blind deconvolution based on decorrelation technique and broadband block matrix.Althougt...In order to alleviate the shortcomings of most blind deconvolution algorithms,this paper proposes an improved fast algorithm for blind deconvolution based on decorrelation technique and broadband block matrix.Althougth the original algorithm can overcome the shortcomings of current blind deconvolution algorithms,it has a constraint that the number of the source signals must be less than that of the channels.The improved algorithm deletes this constraint by using decorrelation technique.Besides,the improved algorithm raises the separation speed in terms of improving the computing methods of the output signal matrix.Simulation results demonstrate the validation and fast separation of the improved algorithm.展开更多
In this paper, we obtain a formula for the derivative of a determinant with respect to an eigenvalue in the modified Cholesky decomposition of a symmetric matrix, a characteristic example of a direct solution method i...In this paper, we obtain a formula for the derivative of a determinant with respect to an eigenvalue in the modified Cholesky decomposition of a symmetric matrix, a characteristic example of a direct solution method in computational linear algebra. We apply our proposed formula to a technique used in nonlinear finite-element methods and discuss methods for determining singular points, such as bifurcation points and limit points. In our proposed method, the increment in arc length (or other relevant quantities) may be determined automatically, allowing a reduction in the number of basic parameters. The method is particularly effective for banded matrices, which allow a significant reduction in memory requirements as compared to dense matrices. We discuss the theoretical foundations of our proposed method, present algorithms and programs that implement it, and conduct numerical experiments to investigate its effectiveness.展开更多
This paper gives the rank of matrix and equalities and inequalities of the difference number of non-zero eigenvalue, and discuss the equivalent description of multi angle of equalities for upper and lower bounds of th...This paper gives the rank of matrix and equalities and inequalities of the difference number of non-zero eigenvalue, and discuss the equivalent description of multi angle of equalities for upper and lower bounds of the inequality.展开更多
A connected graph G=(V,E)is called a quasi-tree graph if there exists a vertex v0∈V(G)such that G-v0 is a tree.In this paper,we determine all quasi-tree graphs of order n with the second largest signless Laplacian ei...A connected graph G=(V,E)is called a quasi-tree graph if there exists a vertex v0∈V(G)such that G-v0 is a tree.In this paper,we determine all quasi-tree graphs of order n with the second largest signless Laplacian eigenvalue greater than or equal to n-3.As an application,we determine all quasi-tree graphs of order n with the sum of the two largest signless Laplacian eigenvalues greater than to 2 n-5/4.展开更多
In this article, an attempt based on Spin Topological Space, STS, to give areasonable detailed account of the cause of photonic fermionization phenomena of light photon is made. STS is an unconventional spin space in ...In this article, an attempt based on Spin Topological Space, STS, to give areasonable detailed account of the cause of photonic fermionization phenomena of light photon is made. STS is an unconventional spin space in quantum mechanics, which can be used to account for where the unconventional half-integer spin eigenvalues phenomenon of light photon comes from. We suggest to dectect the possible existence of photonic one-third-spinization phenomenon of light photon, by using three beams of light photon in interference experiment.展开更多
In this paper we investigate the least eigenvalue of a graph whose complement is connected, and present a lower bound for the least eigenvalue of such graph. We also characterize the unique graph whose least eigenvalu...In this paper we investigate the least eigenvalue of a graph whose complement is connected, and present a lower bound for the least eigenvalue of such graph. We also characterize the unique graph whose least eigenvalue attains the second minimum among all graphs of fixed order.展开更多
基金Supported by the National Natural Science Foundation of China(2 0 0 0 CG0 1 0 3) the Fund of"The Developing Program for Outstanding Person"in NPUS & T Innovation Foundation for Young Teachers of Northwestern Polytechnical University.
文摘In this paper, the spectrum and characteristic polynomial for a special kind of symmetric block circulant matrices are given.
基金National Natural Science Foundation of China(Nos.41571410,41977067,42171422)。
文摘In this study,the problem of bundle adjustment was revisited,and a novel algorithm based on block matrix Cholesky decomposition was proposed to solve the thorny problem of self-calibration bundle adjustment.The innovation points are reflected in the following aspects:①The proposed algorithm is not dependent on the Schur complement,and the calculation process is simple and clear;②The complexities of time and space tend to O(n)in the context of world point number is far greater than that of images and cameras,so the calculation magnitude and memory consumption can be reduced significantly;③The proposed algorithm can carry out self-calibration bundle adjustment in single-camera,multi-camera,and variable-camera modes;④Some measures are employed to improve the optimization effects.Experimental tests showed that the proposed algorithm has the ability to achieve state-of-the-art performance in accuracy and robustness,and it has a strong adaptability as well,because the optimized results are accurate and robust even if the initial values have large deviations from the truth.This study could provide theoretical guidance and technical support for the image-based positioning and 3D reconstruction in the fields of photogrammetry,computer vision and robotics.
文摘We demonstrate that, when computing the LDU decomposition (a typical example of a direct solution method), it is possible to obtain the derivative of a determinant with respect to an eigenvalue of a non-symmetric matrix. Our proposed method augments an LDU decomposition program with an additional routine to obtain a program for easily evaluating the derivative of a determinant with respect to an eigenvalue. The proposed method follows simply from the process of solving simultaneous linear equations and is particularly effective for band matrices, for which memory requirements are significantly reduced compared to those for dense matrices. We discuss the theory underlying our proposed method and present detailed algorithms for implementing it.
文摘An efficient and stable structure preserving algorithm, which is a variant of the QR like (SR) algorithm due to Bunse-Gerstner and Mehrmann, is presented for computing the eigenvalues and stable invariant subspaces of a Hamiltonian matrix. In the algorithm two strategies are employed, one of which is called dis-unstabilization technique and the other is preprocessing technique. Together with them, a so-called ratio-reduction equation and a backtrack technique are introduced to avoid the instability and breakdown in the original algorithm. It is shown that the new algorithm can overcome the instability and breakdown at low cost. Numerical results have demonstrated that the algorithm is stable and can compute the eigenvalues to very high accuracy.
基金Sponsored by the National Natural Science Foundation of China(Grant No.61179026)the Fundamental Research of the Central Universities of China Civil Aviation University of Science Special(Grant No.3122016L005)
文摘We construct one multi-sender authentication code by algebraic combination method from eigenvalues and eigenvectors of the matrix over nite elds. Some parameters and the probabilities of three kinds of successful attack of this code are also computed. For multi-sender authentication code,it allows a group of senders to construct an authenticated message for a receiver such that the receiver can verify authenticity of the received message.
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 60877055 and 60806041)the Shanghai Rising-Star Program,China (Grant No. 08QA14030)+1 种基金the Innovation Funds for Graduates of Shanghai University,China (Grant No. SHUCX092021)the Foundation of the Science and Technology Commission of Shanghai Municipality,China (Grant No. 08JC14097)
文摘A detailed procedure based on an analytical transfer matrix method is presented to solve bound-state problems. The derivation is strict and complete. The energy eigenvalues for an arbitrary one-dimensional potential can be obtained by the method. The anharmonic oscillator potential and the rational potential are two important examples. Checked by numerical techniques, the results for the two potentials by the present method are proven to be exact and reliable.
文摘A new matrix perturbation analysis method is presented for efficient approximate solution of the complex modal quadratic generalized eigenvalue problem of viscously damped linear vibration systems. First, the damping matrix is decomposed into the sum of a proportional-and a nonproportional-damping parts, and the solutions of the real modal eigenproblem with the proportional dampings are determined, which are a set of initial approximate solutions of the complex modal eigenproblem. Second, by taking the nonproportional-damping part as a small modification to the proportional one and using the matrix perturbation analysis method, a set of approximate solutions of the complex modal eigenvalue problem can be obtained analytically. The result is quite simple. The new method is applicable to the systems with viscous dampings-which do not deviate far away from the proportional-damping case. It is particularly important that the solution technique be also effective to the systems with heavy, but not over, dampings. The solution formulas of complex modal eigenvlaues and eigenvectors are derived up to second-order perturbation terms. The effectiveness of the perturbation algorithm is illustrated by an exemplar numerical problem with heavy dampings. In addition, the practicability of approximately estimating the complex modal eigenvalues, under the proportional-damping hypothesis, of damped vibration systems is discussed by several numerical examples.
基金Project supported by the Scientific Starting Research Fund of Central China Normal University of Chinathe National Natural Science Foundation of China (Grant Nos 10675052 and 10875050)Ministry of Education of China (Grant No IRT0624)
文摘A matrix eigenvalue method is applied to analyse the thermodynamic stability of two-component interacting fermions. The non-relativistic and ultra-relativistic d = 1, 2, 3 dimensions have been discussed in detail, respectively. The corresponding stability region has been given according to the two-body interaction strength and the particle number density ratio.
文摘The paper contains two parts. First, by applying the results about the eigenvalue perturbation bounds for Hermitian block tridiagonal matrices in paper [1], we obtain a new efficient method to estimate the perturbation bounds for singular values of block tridiagonal matrix. Second, we consider the perturbation bounds for eigenvalues of Hermitian matrix with block tridiagonal structure when its two adjacent blocks are perturbed simultaneously. In this case, when the eigenvalues of the perturbed matrix are well-separated from the spectrum of the diagonal blocks, our eigenvalues perturbation bounds are very sharp. The numerical examples illustrate the efficiency of our methods.
基金supported by the National Natural Science Foundation of China(No.11101149)the Basic Academic Discipline Program of Shanghai University of Finance and Economics(No.2013950575)
文摘An improved modal truncation method with arbitrarily high order accuracy is developed for calculating the second- and third-order eigenvalue derivatives and the first- and second-order eigenvector derivatives of an asymmetric and non-defective matrix with repeated eigenvalues. If the different eigenvalues λ1, λ2,……, λs of the matrix satisfy ｜λ1｜ ≤... ≤｜λr｜ and ｜λs｜ 〈｜〈s＋1｜ （s ≤r-l）, then associated with any eigenvalue λi （i≤ s）, the errors of the eigenvalue and eigenvector derivatives obtained by the qth-order approximate method are proportional to ｜λi｜/λs＋1｜q＋l, where the approximate method only uses the eigenpairs corresponding to λ1, λ2,……,λs A numerical example shows the validity of the approximate method. The numerical example also shows that in order to get the approximate solutions with the same order accuracy, a higher order method should be used for higher order eigenvalue and eigenvector derivatives.
文摘A new approach that bounds the largest eigenvalue of 3 × 3 correlation matrices is presented. Optimal bounds by given determinant and trace of the squared correlation matrix are derived and shown to be more stringent than the optimal bounds by Wolkowicz and Styan in specific cases.
基金Supported by the Fund for Postdoctoral of China(2015M581688)Supported by the National Natural Science Foundation of China(11371089)+2 种基金Supported by the Specialized Research Fund for the Doctoral Program of Higher Education(20120092110020)Supported by the Natural Science Foundation of Jiangsu Province(BK20141327)Supported by the Foundation of Xuzhou Institute of Technology(XKY2014207)
文摘In this paper, we present a method how to get the expression for the group inverse of 2×2 block matrix and get the explicit expressions of the block matrix (A C B D) under some conditions.
基金supported in part by the “Pioneer” and “Leading Goose” R&D Program of Zhejiang (Grant No. 2022C03174)the National Natural Science Foundation of China (No. 92067103)+4 种基金the Key Research and Development Program of Shaanxi (No.2021ZDLGY06- 02)the Natural Science Foundation of Shaanxi Province (No.2019ZDLGY12-02)the Shaanxi Innovation Team Project (No.2018TD007)the Xi’an Science and technology Innovation Plan (No.201809168CX9JC10)National 111 Program of China B16037
文摘Cloud computing provides powerful processing capabilities for large-scale intelligent Internet of things(IoT)terminals.However,the massive realtime data processing requirements challenge the existing cloud computing model.The edge server is closer to the data source.The end-edge-cloud collaboration offloads the cloud computing tasks to the edge environment,which solves the shortcomings of the cloud in resource storage,computing performance,and energy consumption.IoT terminals and sensors have caused security and privacy challenges due to resource constraints and exponential growth.As the key technology of IoT,Radio-Frequency Identification(RFID)authentication protocol tremendously strengthens privacy protection and improves IoT security.However,it inevitably increases system overhead while improving security,which is a major blow to low-cost RFID tags.The existing RFID authentication protocols are difficult to balance overhead and security.This paper designs an ultra-lightweight encryption function and proposes an RFID authentication scheme based on this function for the end-edge-cloud collaborative environment.The BAN logic proof and protocol verification tools AVISPA formally verify the protocol’s security.We use VIVADO to implement the encryption function and tag’s overhead on the FPGA platform.Performance evaluation indicates that the proposed protocol balances low computing costs and high-security requirements.
基金Natural Science Fund of Anhui Province of China (050420101)
文摘In order to alleviate the shortcomings of most blind deconvolution algorithms,this paper proposes an improved fast algorithm for blind deconvolution based on decorrelation technique and broadband block matrix.Althougth the original algorithm can overcome the shortcomings of current blind deconvolution algorithms,it has a constraint that the number of the source signals must be less than that of the channels.The improved algorithm deletes this constraint by using decorrelation technique.Besides,the improved algorithm raises the separation speed in terms of improving the computing methods of the output signal matrix.Simulation results demonstrate the validation and fast separation of the improved algorithm.
文摘In this paper, we obtain a formula for the derivative of a determinant with respect to an eigenvalue in the modified Cholesky decomposition of a symmetric matrix, a characteristic example of a direct solution method in computational linear algebra. We apply our proposed formula to a technique used in nonlinear finite-element methods and discuss methods for determining singular points, such as bifurcation points and limit points. In our proposed method, the increment in arc length (or other relevant quantities) may be determined automatically, allowing a reduction in the number of basic parameters. The method is particularly effective for banded matrices, which allow a significant reduction in memory requirements as compared to dense matrices. We discuss the theoretical foundations of our proposed method, present algorithms and programs that implement it, and conduct numerical experiments to investigate its effectiveness.
文摘This paper gives the rank of matrix and equalities and inequalities of the difference number of non-zero eigenvalue, and discuss the equivalent description of multi angle of equalities for upper and lower bounds of the inequality.
基金Supported by the National Natural Science Foundation of China(Grant No.11771443)the Fundamental Research Funds for the Central Universities(Grant No.2018BSCXB24)the Postgraduate Research&Practice Innovation Program of Jiangsu Province(Grant No.KYCX18JL980).
文摘A connected graph G=(V,E)is called a quasi-tree graph if there exists a vertex v0∈V(G)such that G-v0 is a tree.In this paper,we determine all quasi-tree graphs of order n with the second largest signless Laplacian eigenvalue greater than or equal to n-3.As an application,we determine all quasi-tree graphs of order n with the sum of the two largest signless Laplacian eigenvalues greater than to 2 n-5/4.
文摘In this article, an attempt based on Spin Topological Space, STS, to give areasonable detailed account of the cause of photonic fermionization phenomena of light photon is made. STS is an unconventional spin space in quantum mechanics, which can be used to account for where the unconventional half-integer spin eigenvalues phenomenon of light photon comes from. We suggest to dectect the possible existence of photonic one-third-spinization phenomenon of light photon, by using three beams of light photon in interference experiment.
基金Supported by National Natural Science Foundation of China (Grant No. 11071002)Program for New Century Excellent Talents in University, Key Project of Chinese Ministry of Education (Grant No. 210091)+8 种基金Specialized Research Fund for the Doctoral Program of Higher Education (Grant No. 20103401110002)Science and Technological Fund of Anhui Province for Outstanding Youth (Grant No. 10040606Y33)the Natural Science Foundation of Department of Education of Anhui Province (Grant Nos. KJ2011A195 KJ2010B136)Project of Anhui Province for Excellent Young Talents in Universities (Grant No. 2009SQRZ017ZD)Scientific Research Fund for Fostering Distinguished Young Scholars of Anhui University (Grant No. KJJQ1001)Project for Academic Innovation Team of Anhui University (Grant No. KJTD001B)Fund for Youth Scientific Research of Anhui University (Grant No. KJQN1003)Innovation Fund for Graduates of Anhui University
文摘In this paper we investigate the least eigenvalue of a graph whose complement is connected, and present a lower bound for the least eigenvalue of such graph. We also characterize the unique graph whose least eigenvalue attains the second minimum among all graphs of fixed order.
