Switching classes of directed graphs
From MaRDI portal
Publication:1058524
DOI10.1016/0095-8956(86)90075-4zbMath0565.05034OpenAlexW2083490505MaRDI QIDQ1058524
Ying Cheng, Albert L. jun. Wells
Publication date: 1986
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(86)90075-4
enumerationalternating functioncyclic triple covers of the complete digraphMallows-Sloane Theoremswitching classes of digraphsswitching equivalent digraphstwo-digraphs
Related Items
Switching classes of directed graphs and H-equivalent matrices ⋮ Aspects of topological approaches for data science ⋮ Enumeration of finite field labels on graphs ⋮ Speeding up Graph Algorithms via Switching Classes ⋮ Criticality of switching classes of reversible 2-structures labeled by an abelian group ⋮ Cohomological Aspects of Hypergraphs
Cites Work