書目名稱Graphs and Matrices網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書目名稱Graphs and Matrices被引頻次
書目名稱Graphs and Matrices被引頻次學(xué)科排名
書目名稱Graphs and Matrices年度引用
書目名稱Graphs and Matrices年度引用學(xué)科排名
書目名稱Graphs and Matrices讀者反饋
書目名稱Graphs and Matrices讀者反饋學(xué)科排名
作者: 引起 時(shí)間: 2025-3-21 21:29 作者: 狂亂 時(shí)間: 2025-3-22 02:48 作者: adulterant 時(shí)間: 2025-3-22 08:28
Themenhefte Schwerpunktprogramm Umweltted. The Matrix-Tree Theorem and some related results are proved. Bounds for the Laplacian spectral radius are obtained. The edge-Laplacian is considered and a formula for the inverse of the edge-Laplacian of a tree is obtained. In the process we also obtain a formula for the Moore-Penrose inverse of the incdence matrix of a tree.作者: 注意 時(shí)間: 2025-3-22 10:18 作者: Neuralgia 時(shí)間: 2025-3-22 16:24
https://doi.org/10.1007/978-3-662-58390-6 a partitioned matrix and Cauchy–Binet formula. Important properties of eigenvalues of symmetric matrices, including Spectral Theorem and Interlacing Theorem are reviewed. Basic notions of generalized inverses, including Moore–Penrose inverse are stated. Relevant concepts and results are given, although we omit the proofs.作者: Neuralgia 時(shí)間: 2025-3-22 18:56
https://doi.org/10.1007/978-3-663-12252-4l matrices. The interplay between the two matrices and the incidence matrix is considered in detail. Minors of the fundamental matrices are described in terms of the graph. Some of the results appear in print form for the first time. The development in this chapter is different than that found in most texts.作者: A簡(jiǎn)潔的 時(shí)間: 2025-3-22 22:53
Mutagenesis in Sub-Mammalian Systemsthe line graph of a tree and those of the Laplacian as well as the signless Laplacian are shown to be related to each other. This connection is exploited to obtain several statements centered around the classical result that the nullity of the line graph of a tree is at most one.作者: 星球的光亮度 時(shí)間: 2025-3-23 02:35 作者: 魅力 時(shí)間: 2025-3-23 08:25
https://doi.org/10.1007/978-981-16-9720-3n detail. We first illustrate the concept of matrix completion by considering the nonsingular completion problem. We then introduce the preliminaries on chordal graphs. Then we prove the main result that a graph is positive definite completable if and only if it is chordal.作者: esthetician 時(shí)間: 2025-3-23 10:03
Preliminaries, a partitioned matrix and Cauchy–Binet formula. Important properties of eigenvalues of symmetric matrices, including Spectral Theorem and Interlacing Theorem are reviewed. Basic notions of generalized inverses, including Moore–Penrose inverse are stated. Relevant concepts and results are given, although we omit the proofs.作者: Inexorable 時(shí)間: 2025-3-23 16:18 作者: Hallowed 時(shí)間: 2025-3-23 20:56
Regular Graphs,the line graph of a tree and those of the Laplacian as well as the signless Laplacian are shown to be related to each other. This connection is exploited to obtain several statements centered around the classical result that the nullity of the line graph of a tree is at most one.作者: aspect 時(shí)間: 2025-3-24 00:31 作者: 起來(lái)了 時(shí)間: 2025-3-24 04:34 作者: 同時(shí)發(fā)生 時(shí)間: 2025-3-24 09:08 作者: 形容詞詞尾 時(shí)間: 2025-3-24 13:11 作者: 套索 時(shí)間: 2025-3-24 16:04
Wolfgang Scholl,Frank Schmelzer,Sandra Tirre Stanley on counting directed paths is proved. In the final section we discuss trees which have a nonsingular adjacency matrix, and identify the cases when the inverse of the adjacency matrix corresponds to a graph.作者: resuscitation 時(shí)間: 2025-3-24 19:43
https://doi.org/10.1007/978-3-658-17121-6djacency matrix of a regular graph and that of its complement and line graph. Several results in this direction are proved in the next section. In the final section we derive spectral properties of strongly regular graph and apply them to derive the well-known Friendship Theorem.作者: 地牢 時(shí)間: 2025-3-25 02:08 作者: Gobble 時(shí)間: 2025-3-25 05:51
https://doi.org/10.1007/978-3-662-67273-0 well-known “scissors, paper and stone” game, is considered. We show that in a tournament game, both the players have a unique optimal strategy. We then consider incidence matrix games, where the payoff matrix is the incidence matrix of a directed graph. A graph-theoretic description of the value and the optimal strategies is provided.作者: 噴出 時(shí)間: 2025-3-25 09:05 作者: 北極熊 時(shí)間: 2025-3-25 12:49
Cycles and Cuts,djacency matrix of a regular graph and that of its complement and line graph. Several results in this direction are proved in the next section. In the final section we derive spectral properties of strongly regular graph and apply them to derive the well-known Friendship Theorem.作者: 單挑 時(shí)間: 2025-3-25 16:59 作者: Medley 時(shí)間: 2025-3-25 22:13 作者: optional 時(shí)間: 2025-3-26 02:28
https://doi.org/10.1007/978-1-4613-2643-4that bring out the connection between the distance matrix and the Laplacian of a tree. A formula for the inverse of the distance matrix, due to Graham and Lovaász, is proved. In the final section we prove some properties of the eigenvalues of the distance matrix of a tree.作者: 可憎 時(shí)間: 2025-3-26 04:18 作者: 華而不實(shí) 時(shí)間: 2025-3-26 11:09 作者: 啟發(fā) 時(shí)間: 2025-3-26 13:08 作者: 懶洋洋 時(shí)間: 2025-3-26 18:23
Adjacency Matrix,ted. The Matrix-Tree Theorem and some related results are proved. Bounds for the Laplacian spectral radius are obtained. The edge-Laplacian is considered and a formula for the inverse of the edge-Laplacian of a tree is obtained. In the process we also obtain a formula for the Moore-Penrose inverse o作者: SEED 時(shí)間: 2025-3-27 00:39 作者: aristocracy 時(shí)間: 2025-3-27 01:13 作者: Aviary 時(shí)間: 2025-3-27 09:09
Regular Graphs,cy matrix of a block graph. The line graph of a tree is a block graph. Some basic properties of the signless Laplacian are proved. The eigenvalues of the line graph of a tree and those of the Laplacian as well as the signless Laplacian are shown to be related to each other. This connection is exploi作者: conduct 時(shí)間: 2025-3-27 12:03
Line Graph of a Tree,degree of connectivity of the graph. We first prove basic properties of algebraic connectivity and the associated eigenvector, known as Fiedler vector. A classification of trees into two types, based on the Fiedler vector, is described. Some monotonocity properties of the coordinators of the Fiedler作者: 愛(ài)好 時(shí)間: 2025-3-27 17:09
Algebraic Connectivity,tices and not on the structure of the tree. An extension of the result to graphs, due to Graham, Hoffman and Hosoya, is proved next. It asserts that the determinant of the distance matrix of a graph depends only on the blocks, and not on the way in which the blocks are joined. We then prove results 作者: 變白 時(shí)間: 2025-3-27 20:05
Distance Matrix of a Tree,d is also not tractable mathematically. The resistance distance between two vertices is defined to be the effective resistance between the vertices, when the graph is viewed as an electrical network, with a unit resistance along each edge. We begin by giving an equivalent definition in terms of gene作者: incisive 時(shí)間: 2025-3-28 00:23 作者: mettlesome 時(shí)間: 2025-3-28 04:48 作者: CANT 時(shí)間: 2025-3-28 07:51 作者: 摻和 時(shí)間: 2025-3-28 12:51 作者: troponins 時(shí)間: 2025-3-28 17:33 作者: overreach 時(shí)間: 2025-3-28 19:12 作者: excrete 時(shí)間: 2025-3-29 00:41 作者: narcissism 時(shí)間: 2025-3-29 04:46 作者: 親密 時(shí)間: 2025-3-29 09:26 作者: intoxicate 時(shí)間: 2025-3-29 13:16 作者: 不規(guī)則的跳動(dòng) 時(shí)間: 2025-3-29 18:26 作者: 后來(lái) 時(shí)間: 2025-3-29 21:35 作者: 巨碩 時(shí)間: 2025-3-30 01:39
https://doi.org/10.1007/978-3-662-68181-7old graphs. We first review some basic aspects of the theory of majorization. The majorization between the eigenvalues and the diagonal entries of a symmetric matrix is proved. Majorization for integer vectors is considered and the necessity part of the theorem of Gale and Ryser is proved. Threshold作者: 大吃大喝 時(shí)間: 2025-3-30 06:13
https://doi.org/10.1007/978-981-16-9720-3graph theoretic notions with matrix theory. In this chapter we consider one particular completion problem, the positive definite completion problem, in detail. We first illustrate the concept of matrix completion by considering the nonsingular completion problem. We then introduce the preliminaries
