Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Linming Qi"'
Publikováno v:
Mathematics, Vol 10, Iss 8, p 1301 (2022)
Let G be a connected, undirected and simple graph. The distance Laplacian matrix L(G) is defined as L(G)=diag(Tr)−D(G), where D(G) denotes the distance matrix of G and diag(Tr) denotes a diagonal matrix of the vertex transmissions. Denote by ρL(G)
Externí odkaz:
https://doaj.org/article/dd952bfbc24845169802f6c3412fb987
Publikováno v:
Advances in Mathematical Physics, Vol 2020 (2020)
Let G be a simple and undirected graph. The eigenvalues of the adjacency matrix of G are called the eigenvalues of G. In this paper, we characterize all the n-vertex graphs with some eigenvalue of multiplicity n−2 and n−3, respectively. Moreover,
Externí odkaz:
https://doaj.org/article/9d61cd5bc00b4e929edce15379398d23
Publikováno v:
Linear Algebra and its Applications. 557:307-326
The eigenvalues of the distance Laplacian matrix of a connected graph G are called the distance Laplacian eigenvalues of G. Denote by G ( n , n − 3 ) the set of all connected graphs on n vertices with some distance Laplacian eigenvalue of multiplic
Publikováno v:
Mathematical Problems in Engineering, Vol 2020 (2020)
Many small and medium enterprises (SMEs) with capital constraints often have no access or find it costly to obtain a loan from a bank; the retailer tends to borrow money from other enterprises in the supply chain by trade credit financing. We conside