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!
Abstract 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.
AbstractList 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.
Author Qiongxiang, Huang
Huaxiao, Zhang
Fuji, Zhang
Author_xml – sequence: 1
  givenname: Zhang
  surname: Huaxiao
  fullname: Huaxiao, Zhang
  organization: Department of Mathematics, Xinjiang University, Urumqi, Xinjiang 830046, People's Republic of China
– sequence: 2
  givenname: Zhang
  surname: Fuji
  fullname: Fuji, Zhang
  organization: Department of Mathematics, Xiamen University, Xiamen 361005, People's Republic of China
– sequence: 3
  givenname: Huang
  surname: Qiongxiang
  fullname: Qiongxiang, Huang
  organization: Department of Mathematics, Xinjiang University, Urumqi, Xinjiang 830046, People's Republic of China
BookMark eNp9kM1LAzEQxYMo2Fb_Aw856mE1k4_d7EWwpX5AoRcFbyGbzLaRNluSreB_79aKRw_DMPB7j3lvTE5jF5GQK2C3wKC8G6YsOOj361rdMAagi-kJGYGueFFWFZyS0R9yTsY5f7CBGq4RWSwj7ddI437bYKJdS_POxhjiivYJMVMbPZ3vN5iCHchunzINkYYek-3R002ISH1YJbtb5wty1tpNxsvfPSFvj_PX2XOxWD69zB4WhRNM9oXyJQjtKgGtsi04pktmlWQgXKWZbLi0TDS6LTlXWmvBvRTcqbphiLXEWkyIPPq61OWcsDW7FLY2fRlg5tCIOcQ1h7imVuanETMdZPdHGQ6_fQZMJruA0aEPCV1vfBf-N_gGUtdo9w
CitedBy_id crossref_primary_10_1016_j_disc_2008_08_008
crossref_primary_10_1016_j_disc_2014_12_009
crossref_primary_10_1016_j_jcta_2010_04_001
Cites_doi 10.1109/TC.1984.1676455
10.1109/TC.1987.1676963
10.1109/TC.1983.1676323
ContentType Journal Article
Copyright 1997
Copyright_xml – notice: 1997
DBID 6I.
AAFTH
AAYXX
CITATION
DOI 10.1016/0166-218X(95)00118-B
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 1872-6771
EndPage 67
ExternalDocumentID 10_1016_0166_218X_95_00118_B
0166218X9500118B
GroupedDBID -~X
6I.
AAFTH
ADEZE
AFTJW
AI.
ALMA_UNASSIGNED_HOLDINGS
FA8
FDB
OAUVE
VH1
WUQ
AAYXX
CITATION
ID FETCH-LOGICAL-c304t-5d6138c731f5af1c0860a54013c7804b24a03b8f622588832d432c59b0ee94e93
ISSN 0166-218X
IngestDate Fri Aug 23 01:40:18 EDT 2024
Sat Apr 29 22:49:16 EDT 2023
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
License http://www.elsevier.com/open-access/userlicense/1.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c304t-5d6138c731f5af1c0860a54013c7804b24a03b8f622588832d432c59b0ee94e93
OpenAccessLink https://dx.doi.org/10.1016/0166-218X(95)00118-B
PageCount 9
ParticipantIDs crossref_primary_10_1016_0166_218X_95_00118_B
elsevier_sciencedirect_doi_10_1016_0166_218X_95_00118_B
PublicationCentury 1900
PublicationDate 1997-02-21
PublicationDateYYYYMMDD 1997-02-21
PublicationDate_xml – month: 02
  year: 1997
  text: 1997-02-21
  day: 21
PublicationDecade 1990
PublicationTitle Discrete Applied Mathematics
PublicationYear 1997
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Imase, Itoh (BIB10) 1983; C-30
Xueliang, Fuji (BIB12) 1991; 91
Bermond (BIB1) 1983; Vol. 28
Biggs (BIB3) 1974
Bermond, Bermond (BIB2) 1986; 5
Fuji, Guoning (BIB7) 1983; 22
Hemminger (BIB9) 1972; Vol. 303
Chen (BIB4) 1971
Fiol (BIB5) 1984; C-33
Fuji, Xueliang, Qiongxiang, xin (BIB8) 1992; 13B
Kautz (BIB11) 1969
Fiol (BIB6) 1987; C-36
Fiol (10.1016/0166-218X(95)00118-B_BIB5) 1984; C-33
Chen (10.1016/0166-218X(95)00118-B_BIB4) 1971
Kautz (10.1016/0166-218X(95)00118-B_BIB11) 1969
Fuji (10.1016/0166-218X(95)00118-B_BIB8) 1992; 13B
Bermond (10.1016/0166-218X(95)00118-B_BIB1) 1983; Vol. 28
Hemminger (10.1016/0166-218X(95)00118-B_BIB9) 1972; Vol. 303
Fuji (10.1016/0166-218X(95)00118-B_BIB7) 1983; 22
Imase (10.1016/0166-218X(95)00118-B_BIB10) 1983; C-30
Biggs (10.1016/0166-218X(95)00118-B_BIB3) 1974
Bermond (10.1016/0166-218X(95)00118-B_BIB2_2) 1989; 5
Bermond (10.1016/0166-218X(95)00118-B_BIB2_1) 1986
Xueliang (10.1016/0166-218X(95)00118-B_BIB12) 1991; 91
Fiol (10.1016/0166-218X(95)00118-B_BIB6) 1987; C-36
References_xml – volume: Vol. 303
  start-page: 149
  year: 1972
  end-page: 163
  ident: BIB9
  article-title: Line digraphs
  publication-title: Proceedings of the Conference at Western Michigan University
  contributor:
    fullname: Hemminger
– volume: 91
  start-page: 189
  year: 1991
  end-page: 197
  ident: BIB12
  article-title: On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
  publication-title: Discrete Math.
  contributor:
    fullname: Fuji
– volume: C-30
  start-page: 782
  year: 1983
  end-page: 784
  ident: BIB10
  article-title: Design to minimize diameter on building-block networks
  publication-title: IEEE Trans. Comput.
  contributor:
    fullname: Itoh
– volume: C-36
  start-page: 702
  year: 1987
  end-page: 713
  ident: BIB6
  article-title: A discrete optimization problem in local networks and data alignment
  publication-title: IEEE Trans. Comput.
  contributor:
    fullname: Fiol
– year: 1971
  ident: BIB4
  article-title: Applied Graph Theory
  contributor:
    fullname: Chen
– volume: C-33
  start-page: 400
  year: 1984
  end-page: 403
  ident: BIB5
  article-title: Line digraph iteration and the (
  publication-title: IEEE Trans. Comput.
  contributor:
    fullname: Fiol
– start-page: 219
  year: 1969
  end-page: 272
  ident: BIB11
  article-title: Design of optimal interconnection networks for multiprocessors
  publication-title: Architecture and Design of Digital Computers
  contributor:
    fullname: Kautz
– year: 1974
  ident: BIB3
  article-title: Algebraic Graph Theory
  contributor:
    fullname: Biggs
– volume: Vol. 28
  year: 1983
  ident: BIB1
  article-title: Graph and interconnection networks: diameter and vulnerability
  publication-title: Surveys in Combinatorics
  contributor:
    fullname: Bermond
– volume: 22
  start-page: 1348
  year: 1983
  end-page: 1351
  ident: BIB7
  article-title: The characteristic polynomial of the directed line graph and a type of cospectral digraphs
  publication-title: Kexue Tongbao
  contributor:
    fullname: Guoning
– volume: 13B
  start-page: 368
  year: 1992
  end-page: 373
  ident: BIB8
  article-title: Digraph categories and line digraph functors
  publication-title: Chinese Ann. Math.
  contributor:
    fullname: xin
– volume: 5
  start-page: 107
  year: 1986
  end-page: 123
  ident: BIB2
  article-title: Large fault tolerant interconnection networks
  publication-title: Proceedings of the 1st Japan International Conference on Graph Theory and Applications
  contributor:
    fullname: Bermond
– volume: 22
  start-page: 1348
  year: 1983
  ident: 10.1016/0166-218X(95)00118-B_BIB7
  article-title: The characteristic polynomial of the directed line graph and a type of cospectral digraphs
  publication-title: Kexue Tongbao
  contributor:
    fullname: Fuji
– volume: C-33
  start-page: 400
  year: 1984
  ident: 10.1016/0166-218X(95)00118-B_BIB5
  article-title: Line digraph iteration and the (d, k) digraph problem
  publication-title: IEEE Trans. Comput.
  doi: 10.1109/TC.1984.1676455
  contributor:
    fullname: Fiol
– volume: 5
  start-page: 107
  year: 1989
  ident: 10.1016/0166-218X(95)00118-B_BIB2_2
  contributor:
    fullname: Bermond
– volume: C-36
  start-page: 702
  year: 1987
  ident: 10.1016/0166-218X(95)00118-B_BIB6
  article-title: A discrete optimization problem in local networks and data alignment
  publication-title: IEEE Trans. Comput.
  doi: 10.1109/TC.1987.1676963
  contributor:
    fullname: Fiol
– volume: C-30
  start-page: 782
  year: 1983
  ident: 10.1016/0166-218X(95)00118-B_BIB10
  article-title: Design to minimize diameter on building-block networks
  publication-title: IEEE Trans. Comput.
  doi: 10.1109/TC.1983.1676323
  contributor:
    fullname: Imase
– start-page: 219
  year: 1969
  ident: 10.1016/0166-218X(95)00118-B_BIB11
  article-title: Design of optimal interconnection networks for multiprocessors
  contributor:
    fullname: Kautz
– year: 1986
  ident: 10.1016/0166-218X(95)00118-B_BIB2_1
  article-title: Large fault tolerant interconnection networks
  contributor:
    fullname: Bermond
– volume: Vol. 303
  start-page: 149
  year: 1972
  ident: 10.1016/0166-218X(95)00118-B_BIB9
  article-title: Line digraphs
  contributor:
    fullname: Hemminger
– year: 1971
  ident: 10.1016/0166-218X(95)00118-B_BIB4
  contributor:
    fullname: Chen
– volume: Vol. 28
  year: 1983
  ident: 10.1016/0166-218X(95)00118-B_BIB1
  article-title: Graph and interconnection networks: diameter and vulnerability
  contributor:
    fullname: Bermond
– year: 1974
  ident: 10.1016/0166-218X(95)00118-B_BIB3
  contributor:
    fullname: Biggs
– volume: 13B
  start-page: 368
  year: 1992
  ident: 10.1016/0166-218X(95)00118-B_BIB8
  article-title: Digraph categories and line digraph functors
  publication-title: Chinese Ann. Math.
  contributor:
    fullname: Fuji
– volume: 91
  start-page: 189
  year: 1991
  ident: 10.1016/0166-218X(95)00118-B_BIB12
  article-title: On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
  publication-title: Discrete Math.
  contributor:
    fullname: Xueliang
SSID ssj0001218
ssj0000186
ssj0006644
Score 1.5412079
Snippet This paper provides closed-form expressions for the number of directed spanning trees and Eulerian tours in iterated line graphs of regular digraphs. Some...
SourceID crossref
elsevier
SourceType Aggregation Database
Publisher
StartPage 59
Title On the number of spanning trees and Eulerian tours in iterated line digraphs
URI https://dx.doi.org/10.1016/0166-218X(95)00118-B
Volume 73
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://sdu.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Jb9QwFLam00s5VGUTLYt8AAkOFhnH67FLUEFAhShSb1ES21UQSqtOR-Ln87wlgwYhQOISzTh2Evl9ef788haEnmtnqDHCEUWZJMxRQVrZdES3hW2K0ghlfbzz6Wf58UKdVKyazbJpYGr7r5KGNpC1j5z9C2mPF4UG-A0yhyNIHY5_JPez6LcYK314KggqI5Ql8j7lNmZkrlbf_KNAT7hicIiNyZWBfAbWafqQx3q5zlxPelAwwLBH3vphTPi6nLDRfO-bYHwNhugRHKuv_UbjJ5iCS-gelQ0MTadMismTIaR7MkFsxsZEU6UQ0CsUDoaVJqpXJSkRMhZdyfo3ljL5CWdRmaZU4XFZjkU7NhR-tD2M9wJWrvkLqkNqOzJ9BJpcD31X31Pz0OdoC21T0FF8jrYP31YX79Zyj_nEejvZWjd9nAKSxlLK-HjTHJG5EK_Htpeav0oP8WvGs8ZizvfQbtp-4MOIm7toZod76M6aKO-j92cDhr84IghfOZwRhAOCMCAIZwThgCDcDzgjCHsE4YygB-jLm-r8-JSkmhukKwt2S7gBfqc6WS4cb9yigx1v0XC_Ce98qqqWMniDW-UErANKwXJgWEk77l9tq5nV5UM0H64G-whhBTxICOvahWqYLqS2heo4pwpooWmN20ckz0t9HVOr1Nnn0M9j7eex1jy4Xar6aB_JPHl1ooeR9tUAht-OPPjnkY_RzgT4J2h-e7OyT9HW0qyeJbz8ADLjf0s
link.rule.ids 315,782,786,27935,27936
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+the+number+of+spanning+trees+and+Eulerian+tours+in+iterated+line+digraphs&rft.jtitle=Discrete+Applied+Mathematics&rft.au=Huaxiao%2C+Zhang&rft.au=Fuji%2C+Zhang&rft.au=Qiongxiang%2C+Huang&rft.date=1997-02-21&rft.pub=Elsevier+B.V&rft.issn=0166-218X&rft.eissn=1872-6771&rft.volume=73&rft.issue=1&rft.spage=59&rft.epage=67&rft_id=info:doi/10.1016%2F0166-218X%2895%2900118-B&rft.externalDocID=0166218X9500118B
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0166-218X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0166-218X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0166-218X&client=summon