Which digraphs with ring structure are essentially cyclic?
type: Item
instance of: scholarly article
title: Which digraphs with ring structure are essentially cyclic?
zbMATH Open document ID: 1213.05107
published in: Advances in Applied Mathematics
publication date: 2010-07-13T00:00:00Z
full work available at URL: https://arxiv.org/abs/0910.3113
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 5736387
zbMATH Keywords: Laplacian matrix
zbMATH Keywords: Laplacian spectrum
zbMATH Keywords: essential cyclicity
zbMATH Keywords: Chebyshev polynomial
zbMATH Keywords: spanning tree
zbMATH Keywords: Directed graph
zbMATH Keywords: weighted digraph
author: R. P. Agaev
author: Pavel Chebotarev
MaRDI profile type: Publication
OpenAlex ID: W1991753382
arXiv ID: 0910.3113
cites work: The matrix of maximum out forests of a digraph and its applications
cites work: Spanning forests of a digraph and their applications
cites work: On the spectra of nonsymmetric Laplacian matrices
cites work: Eigenvalues of the Laplacian of a graph∗
cites work: Spanning tree formulas and Chebyshev polynomials
cites work: Kernels of directed graph Laplacians
cites work: Forest matrices around the Laplacian matrix
cites work: Coordination in multiagent systems and Laplacian spectra of digraphs
cites work: The matrix-forest theorem and measuring relations in small social groups
cites work: On proximity measures for graph vertices
cites work: Laplacians and the Cheeger inequality for directed graphs
cites work: Q3907599
cites work: Bounds for eigenvalues of doubly stochastic matrices
cites work: On $W$-bases of directed graphs
cites work: Parallel concepts in graph theory
cites work: Q5331504
cites work: Consensus and Cooperation in Networked Multi-Agent Systems
cites work: Q3857645
cites work: Distributed consensus in multi-vehicle cooperative control. Theory and applications.
cites work: Q4866682
cites work: Flocks and formations
cites work: Algebraic connectivity of directed graphs
cites work: Chebyshev polynomials and spanning tree formulas for circulant and related graphs
DOI: 10.1016/J.AAM.2010.01.005
description: scientific article