Spectra of some interesting combinatorial matrices related to oriented spanning trees on a directed graph
type: Item
instance of: scholarly article
title: Spectra of some interesting combinatorial matrices related to oriented spanning trees on a directed graph
zbMATH Open document ID: 0846.05057
DOI: 10.1023/A:1022432212605
author: Christos A. Athanasiadis
published in: Journal of Algebraic Combinatorics
publication date: 1996-09-29T00:00:00Z
review text: For a digraph \(G\) let \(D(G)\) be the digraph whose vertices are all oriented rooted spanning trees of \(G\) with arcs connecting vertices corresponding to oriented rooted spanning trees which can be obtained one from the other by a local transformation defined in the paper. The author relates eigenvalues of \(D(G)\) to eigenvalues of induced subgraphs of \(G\) and to Laplacian eigenvalues of \(G\).
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 843617
zbMATH Keywords: digraph
zbMATH Keywords: oriented rooted spanning trees
zbMATH Keywords: eigenvalues
zbMATH Keywords: Laplacian eigenvalues
reviewed by: Dragoš Cvetković
MaRDI profile type: Publication
cites work: A proof of the Markov chain tree theorem
cites work: Matrix tree theorems
cites work: Alternating-sign matrices and domino tilings. I
cites work: Laplacian matrices of graphs: A survey
full work available at URL: a:1022432212605
OpenAlex ID: W2077815534
description: scientific article; zbMATH DE number 843617