Melola Discovery

← Melola Discovery

Jurnal SINTA 1

A survey on alliances and related parameters in graphs

Electronic Journal of Graph Theory and Applications · Vol. 2 No. 1 (2014) · hlm. 70–86

DOI
10.5614/ejgta.2014.2.1.7
ISSN
2338-2287
Terbit
2014-04-23
Penerbit
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
Bahasa
eng

Abstrak

In this paper, we show that several graph parameters are known in different areas under completely different names.More specifically, our observations connect signed domination, monopolies, $\alpha$-domination, $\alpha$-independence,positive influence domination,and a parameter associated to fast information propagationin networks to parameters related to various notions of global $r$-alliances in graphs.We also propose a new framework, called (global) $(D,O)$-alliances, not only in order to characterizevarious known variants of alliance and domination parameters, but also to suggest a unifying framework for the study of alliances and domination.Finally, we also give a survey on the mentioned graph parameters, indicating how results transfer due to our observations.

Kata kunci

Jaringan kolaborasi para penulis

2 penulis · 1 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

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">A survey on alliances and related parameters in graphs</dc:title>
	<dc:creator>Fernau, Henning; FB 4-Abteilung Informatikwissenschaften,
University of Trier, 54286 Trier, Germany</dc:creator>
	<dc:creator>Rodriguez-Velazquez, Juan A.; Departament d'Enginyeria Informatica i Matematiques, Universitat Rovira i Virgili,
Av. Paisos Catalans 26, 43007 Tarragona, Spain</dc:creator>
	<dc:subject xml:lang="en-US">graph parameters; domination in graphs; alliances in graphs; computational complexity of graph problems</dc:subject>
	<dc:description xml:lang="en-US"> In this paper, we show that several graph parameters are known in different areas under completely different names.More specifically, our observations connect signed domination, monopolies, $\alpha$-domination, $\alpha$-independence,positive influence domination,and a parameter associated to fast information propagationin networks to parameters related to various notions of global $r$-alliances in graphs.We also propose a new framework, called (global) $(D,O)$-alliances, not only in order to characterizevarious known variants of alliance and domination parameters, but also to suggest a unifying framework for the study of alliances and domination.Finally, we also give a survey on the mentioned graph parameters, indicating how results transfer due to our observations.</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>2014-04-23</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/55</dc:identifier>
	<dc:identifier>10.5614/ejgta.2014.2.1.7</dc:identifier>
	<dc:source xml:lang="en-US">Electronic Journal of Graph Theory and Applications (EJGTA); Vol 2, No 1 (2014): Electronic Journal of Graph Theory and Applications; 70 - 86</dc:source>
	<dc:source>2338-2287</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>http://www.ejgta.org/index.php/ejgta/article/view/55/19</dc:relation>
</oai_dc:dc>