On the number of spanning trees and Eulerian tours in iterated line digraphs

On the number of spanning trees and Eulerian tours in iterated line digraphs

This paper provides closed-form expressions for the number of directed spanning trees and Eulerian tours in iterated line graphs of regular digraphs. Some applications are also considered.

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics Vol. 73; no. 1; pp. 59 - 67
Main Authors: Huaxiao, Zhang, Fuji, Zhang, Qiongxiang, Huang
Format: Journal Article
Language:English
Published: Elsevier B.V 21-02-1997
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper provides closed-form expressions for the number of directed spanning trees and Eulerian tours in iterated line graphs of regular digraphs. Some applications are also considered.
ISSN:0166-218X
1872-6771
DOI:10.1016/0166-218X(95)00118-B