Spanning trees in directed circulant graphs and cycle power graphs

Justine Louis

doi:10.1007/s00605-016-0912-2

Spanning trees in directed circulant graphs and cycle power graphs

Combinatorics 2016-08-01 v2

Authors: Justine Louis

View on arXiv ↗ PDF ↗ DOI ↗

Abstract

The number of spanning trees in a class of directed circulant graphs with generators depending linearly on the number of vertices $\beta n$ , and in the $n$ -th and $(n-1)$ -th power graphs of the $\beta n$ -cycle are evaluated as a product of $\lceil\beta/2\rceil-1$ terms.

Keywords

spanning trees phylogenetic trees trees

Cite

@article{arxiv.1507.02990,
  title  = {Spanning trees in directed circulant graphs and cycle power graphs},
  author = {Justine Louis},
  journal= {arXiv preprint arXiv:1507.02990},
  year   = {2016}
}

Comments

11 pages, 2 figures. Published in Monatshefte f\"ur Mathematik

Related papers

View all related →