Ideal basis in constructions defined by directed graphs

DOI10.5614/ejgta.2015.3.1.5zbMath1467.05212OpenAlexW2032388228MaRDI QIDQ5006551

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

Publication date: 16 August 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2015.3.1.5

zbMATH Keywords

digraphstwo-sided idealsweights of idealsincidence settingsvisible bases

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph theory (05C99)

Cites Work

• Edge-maximality of power graphs of finite cyclic groups
• Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring
• On irregular total labellings
• Universal algorithms for solving the matrix Bellman equations over semirings
• On Cayley graphs of rectangular groups
• A formula for multiple classifiers in data mining based on Brandt semigroups
• Cayley graphs as classifiers for data mining: the influence of asymmetries
• A note on constructing large Cayley graphs of given degree and diameter by voltage assignments
• On the structure of digraphs with order close to the Moore bound
• On congruences of automata defined by directed graphs
• The train marshalling problem
• Directed graphs and combinatorial properties of semigroups
• Planar flows and quadratic relations over semirings
• On transitive Cayley graphs of groups and semigroups
• Classification systems based on combinatorial semigroups
• Centroid sets with largest weight in Munn semirings for data mining applications
• Bisimulations for weighted automata over an additively idempotent semiring
• Enumerations of vertex orders of almost Moore digraphs with selfrepeats
• On Cayley graphs of inverse semigroups.
• Reduction relations for monoid semirings
• Power graphs and semigroups of matrices
• A GROUP SUM INEQUALITY AND ITS APPLICATION TO POWER GRAPHS
• Small vertex-transitive and Cayley graphs of girth six and given degree: an algebraic approach
• OPTIMIZATION OF MATRIX SEMIRINGS FOR CLASSIFICATION SYSTEMS
• A POLYNOMIAL RING CONSTRUCTION FOR THE CLASSIFICATION OF DATA
• Digraphs of degree 3 and order close to the moore bound
• On d-antimagic labelings of plane graphs
• Coordinating Asynchronous and Open Distributed Systems under Semiring-Based Timing Constraints
• INCIDENCE SEMIRINGS OF GRAPHS AND VISIBLE BASES
• Algebraic graph theory. Morphisms, monoids and matrices
• Internet security applications of the Munn rings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Ideal basis in constructions defined by directed graphs