Birational equivalence of reduced graphs

DOI10.1016/S0022-4049(96)00100-4zbMath0892.05020MaRDI QIDQ1380010

Carlos Marijuán

Publication date: 21 July 1998

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

zbMATH Keywords

equivalent graphsreduced graphsantisymmetric digraphs

Mathematics Subject Classification ID

Global theory and resolution of singularities (algebro-geometric aspects) (14E15) Rational and birational maps (14E05) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

On graph combinatorics to improve eigenvector-based measures of centrality in directed networks

Cites Work

• Resolution of singularities of an algebraic variety over a field of characteristic zero. I
• Constructiveness of Hironaka's resolution
• On the computer enumeration of finite topologies
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Birational equivalence of reduced graphs