Ideals of Largest Weight in Constructions Based on Directed Graphs-Reference-Cited by-同舟云学术

Ideals of Largest Weight in Constructions Based on Directed Graphs

Published:2016-05 Issue: Volume:15 Page:8-16
ISSN:2278-9634
Container-title:Bulletin of Mathematical Sciences and Applications
language:
Short-container-title:BMSA

Author:

Kelarev Andrei V.¹,Susilo Willy²,Miller Mirka¹,Ryan Joe¹

Affiliation:

1. University of Newcastle

2. University of Wollongong

Abstract

We introduce a new construction based on directed graphs. It provides a common generalization of the incidence rings and Munn semirings. Our main theorem describes all ideals of the largest possible weight in this construction. Several previous results can be obtained as corollaries to our new main theorem.

Publisher

SciPress Ltd

Subject

General Environmental Science

Link

https://www.scipress.com/BMSA.15.8.pdf

Reference33 articles.

1. J. Abawajy, G. Beliakov, A. Kelarev and M. Chowdhury, Iterative construction of hierarchical classifiers for phishing website detection, Journal of Networks 9 (2014), 2089-(2098).

2. J. Abawajy and A. Kelarev, A multi-tier ensemble construction of classifiers for phishing email detection and filtering, Cyberspace Safety and Security, CSS 2012, Lecture Notes in Computer Science 7672 (2012), 48-56.

3. J. Abawajy, A.V. Kelarev and M. Chowdhury, Power graphs: a survey, Electronic J. Graph Theory and Applications 1 (2013), 125-147.

4. J.H. Abawajy, A.V. Kelarev and M. Chowdhury, Multistage approach for clustering and classification of ECG data, Computer Methods and Programs in Biomedicine 112 (2013), 720-730.

5. J. Abawajy, A. Kelarev and M. Chowdhury, Large iterative multitier ensemble classifiers for security of big data, IEEE Transactions on Emerging Topics in Computing 2 (2014), 352-363.