Spanning forests of a digraph and their applications
From MaRDI portal
Publication:1778400
DOI10.1023/A:1002862312617zbMath1063.05056arXivmath/0602061OpenAlexW1479963817MaRDI QIDQ1778400
R. P. Agaev, Pavel Yu. Chebotarev
Publication date: 17 June 2005
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0602061
Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)
Related Items (13)
Models of latent consensus ⋮ The projection method for reaching consensus and the regularized power limit of a stochastic matrix ⋮ Control for a system of linear agents based on a high order adaptation algorithm ⋮ Further results on digraphs with completely real Laplacian spectra ⋮ Application of graph-theoretic approaches to the random landscapes of the three-dimensional assignment problem ⋮ An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification ⋮ Synchronization in networks of linear agents with output feedbacks ⋮ Which digraphs with ring structure are essentially cyclic? ⋮ Consensus in asynchronous multiagent systems. I: Asynchronous consensus models ⋮ Coordination in multiagent systems and Laplacian spectra of digraphs ⋮ Unnamed Item ⋮ Forest matrices around the Laplacian matrix ⋮ Semi-supervised learning with regularized Laplacian
This page was built for publication: Spanning forests of a digraph and their applications
