Melola Discovery

← Melola Discovery

Jurnal SINTA 1

Ideal basis in constructions defined by directed graphs

Electronic Journal of Graph Theory and Applications · Vol. 3 No. 1 (2015) · hlm. 35–49

DOI
10.5614/ejgta.2015.3.1.5
ISSN
2338-2287
Terbit
2015-03-22
Penerbit
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
Bahasa
eng

Abstrak

The present article continues the investigation of visible ideal bases in constructions defined using directed graphs. This notion is motivated by its applications for the design of classication systems. Our main theorem establishes that, for every balanced digraph and each idempotent semiring with identity element, the incidence semiring of the digraph has a convenient visible ideal basis. It also shows that the elements of the basis can always be used to generate ideals with the largest possible weight among the weights of all ideals in the incidence semiring.

Kata kunci

Jaringan kolaborasi para penulis

4 penulis · 5 tautan kepenulisan bersama

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Morshed; Deakin University ChowdhuryAfiliasi tidak diketahui2

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) http://www.ejgta.org/index.php/ejgta/oai, pertama di-harvest 8 Nov 2026, terakhir terlihat 8 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Ideal basis in constructions defined by directed graphs</dc:title>
	<dc:creator>Abawajy, Jemal; Deakin University</dc:creator>
	<dc:creator>Kelarev, Andrei; Deakin University
University of Newcastle</dc:creator>
	<dc:creator>Ryan, Joe; University of Newcastle</dc:creator>
	<dc:subject xml:lang="en-US">balanced graphs, incidence semirings, ideal basis</dc:subject>
	<dc:description xml:lang="en-US">The present article continues the investigation of visible ideal bases in constructions defined using directed graphs. This notion is motivated by its applications for the design of classication systems. Our main theorem establishes that, for every balanced digraph and each idempotent semiring with identity element, the incidence semiring of the digraph has a convenient visible ideal basis. It also shows that the elements of the basis can always be used to generate ideals with the largest possible weight among the weights of all ideals in the incidence semiring.</dc:description>
	<dc:publisher xml:lang="en-US">GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2015-03-22</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>http://www.ejgta.org/index.php/ejgta/article/view/37</dc:identifier>
	<dc:identifier>10.5614/ejgta.2015.3.1.5</dc:identifier>
	<dc:source xml:lang="en-US">Electronic Journal of Graph Theory and Applications (EJGTA); Vol 3, No 1 (2015): Electronic Journal of Graph Theory and Applications; 35-49</dc:source>
	<dc:source>2338-2287</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>http://www.ejgta.org/index.php/ejgta/article/view/37/33</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2015 Electronic Journal of Graph Theory and Applications (EJGTA)</dc:rights>
</oai_dc:dc>