INCIDENCE SEMIRINGS OF GRAPHS AND VISIBLE BASES

DOI10.1017/S000497271300083XzbMath1304.16047MaRDI QIDQ5419388

Mirka Miller, Andrei V. Kelarev, Joseph F. Ryan, Jemal H. Abawajy

Publication date: 6 June 2014

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

left idealsright idealsbalanced graphsincidence semiringsvisible bases

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Semirings (16Y60) Ideals in associative algebras (16D25)

Related Items (max. 100)

Rees semigroups of digraphs for classification of data. ⋮ Distances of centroid sets in a graph-based construction for information security applications ⋮ Ideal basis in constructions defined by directed graphs

Cites Work

• Cayley graphs as classifiers for data mining: the influence of asymmetries
• Classification systems based on combinatorial semigroups
• OPTIMIZATION OF MATRIX SEMIRINGS FOR CLASSIFICATION SYSTEMS
• ON THE STABILISATION OF ONE-SIDED KUROSH’S CHAINS
• A POLYNOMIAL RING CONSTRUCTION FOR THE CLASSIFICATION OF DATA
• On classical Krull dimension of group-graded rings

This page was built for publication: INCIDENCE SEMIRINGS OF GRAPHS AND VISIBLE BASES