Iterating the branching operation on a directed graph

DOI10.1002/(SICI)1097-0118(199703)24:3%3C257::AID-JGT7%3E3.0.CO;2-OMaRDI QIDQ3122900zbMATH OpenOpenAlexFDO

Authors Christos A. Athanasiadis

Publication date 17 September 1997

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199703)24:3%3C257::aid-jgt7%3E3.0.co;2-o

zbMATH Keywords

branchingdirected graphiteratingstrongly connected graphs

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)

Recommendations

• Heredity of the index of convergence of the line digraph
• scientific article; zbMATH DE number 475590
• Convergence of iterated clique graphs
• scientific article; zbMATH DE number 861439

This page was built for publication: Iterating the branching operation on a directed graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3122900)