Pages that link to "Item:Q1855402"
From MaRDI portal
The following pages link to Forest matrices around the Laplacian matrix (Q1855402):
Displayed 37 items.
- The projection method for continuous-time consensus seeking (Q276767) (← links)
- On coefficients of the characteristic polynomial of the Laplace matrix of a weighted digraph and the all minors theorem (Q291166) (← links)
- The walk distances in graphs (Q427888) (← links)
- A class of graph-geodetic distances generalizing the shortest-path and the resistance distances (Q628311) (← links)
- The graph bottleneck identity (Q719327) (← links)
- Centrality measure in graphs (Q977050) (← links)
- Which digraphs with ring structure are essentially cyclic? (Q984026) (← links)
- Coordination in multiagent systems and Laplacian spectra of digraphs (Q1027720) (← links)
- State synchronization of multi-agent systems via static or adaptive nonlinear dynamic protocols (Q1626904) (← links)
- On the characteristic polynomial and eigenvectors in terms of the tree-like structure of a digraph (Q1661494) (← links)
- Further results on digraphs with completely real Laplacian spectra (Q1664250) (← links)
- A generalized inverse for graphs with absorption (Q1675661) (← links)
- On the spectra of nonsymmetric Laplacian matrices (Q1772727) (← links)
- The Grassmann-Berezin calculus and theorems of the matrix-tree type (Q1883393) (← links)
- Trees and forests for nonequilibrium purposes: an introduction to graphical representations (Q2087735) (← links)
- Loop-erased partitioning of a graph: mean-field analysis (Q2144347) (← links)
- Hitting time quasi-metric and its forest representation (Q2174870) (← links)
- Squared-down passivity-based \(H_\infty\) and \(H_2\) almost synchronization of homogeneous continuous-time multi-agent systems with partial-state coupling via static protocol (Q2198754) (← links)
- Structure of minimum-weight directed forests: related forests and convexity inequalities (Q2202670) (← links)
- A combinatorial expression for the group inverse of symmetric \(M\)-matrices (Q2236392) (← links)
- A cyclic representation of discrete coordination procedures (Q2261692) (← links)
- Consensus in asynchronous multiagent systems. I: Asynchronous consensus models (Q2290394) (← links)
- Diffusion and consensus on weakly connected directed graphs (Q2321356) (← links)
- A graph interpretation of the least squares ranking method (Q2340263) (← links)
- On efficient randomized algorithms for finding the PageRank vector (Q2354453) (← links)
- Models of latent consensus (Q2362339) (← links)
- The projection method for reaching consensus and the regularized power limit of a stochastic matrix (Q2392630) (← links)
- On resistance distance of Markov chain and its sum rules (Q2419004) (← links)
- Laplacian dynamics on general graphs (Q2440872) (← links)
- Spanning forests and the golden ratio (Q2476266) (← links)
- Laplace spectra of orgraphs and their applications (Q2487589) (← links)
- A first hitting time approach to finding effective spreaders in a network (Q4965258) (← links)
- (Q5150374) (← links)
- Forest formulas of discrete Green's functions (Q6046689) (← links)
- Drazin-inverse and heat capacity for driven random walkers on the ring (Q6072911) (← links)
- A new distributed protocol for consensus of discrete-time systems (Q6092426) (← links)
- Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians (Q6184481) (← links)