INCIDENCE SEMIRINGS OF GRAPHS AND VISIBLE BASES-Reference-Cited by-同舟云学术

INCIDENCE SEMIRINGS OF GRAPHS AND VISIBLE BASES

Published:2013-09-12 Issue:3 Volume:89 Page:451-459
ISSN:0004-9727
Container-title:Bulletin of the Australian Mathematical Society
language:en
Short-container-title:Bull. Aust. Math. Soc.

Author:

ABAWAJY J.,KELAREV A. V.,MILLER M.,RYAN J.

Abstract

AbstractWe consider the incidence semirings of graphs and prove that every incidence semiring has convenient visible bases for its right ideals and for its left ideals, and that these visible bases can be used to determine the weights of all right ideals that have maximum weight and all left ideals that have maximum weight.

Publisher

Cambridge University Press (CUP)

Subject

General Mathematics

Reference14 articles.

1. OPTIMIZATION OF MATRIX SEMIRINGS FOR CLASSIFICATION SYSTEMS

2. On classical Krull dimension of group-graded rings

3. Classification systems based on combinatorial semigroups

4. ON THE STABILISATION OF ONE-SIDED KUROSH’S CHAINS

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Ideals of Largest Weight in Constructions Based on Directed Graphs;Bulletin of Mathematical Sciences and Applications;2016-05

2. Distances of Centroid Sets in a Graph-Based Construction for Information Security Applications;Mathematics in Computer Science;2015-06

3. Ideal basis in constructions defined by directed graphs;Electronic Journal of Graph Theory and Applications;2015-04-01

4. Rees semigroups of digraphs for classification of data;Semigroup Forum;2015-01-01

5. The semiring variety generated by any finite number of finite fields and distributive lattices;Publications de l'Institut Math?matique (Belgrade);2015