Melola Discovery

← Melola Discovery

Jurnal SINTA 1

Some families of graphs with no nonzero real domination roots

Electronic Journal of Graph Theory and Applications · Vol. 6 No. 1 (2018) · hlm. 17–28

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

Abstrak

Let G be a simple graph of order n. The domination polynomial of G is the polynomial D(G, x) = ∑ni = γ(G)d(G, i)xi, where d(G, i) is the number of dominating sets of G of size i and γ(G) is the domination number of G. A root of D(G, x) is called a domination root of G. Obviously, 0 is a domination root of every graph G with multiplicity γ(G). In the study of the domination roots of graphs, this naturally raises the question: Which graphs have no nonzero real domination roots? In this paper we present some families of graphs whose have this property.

Kata kunci

Jaringan kolaborasi para penulis

5 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
Samaneh; Department of Mathematics, Yazd University, 89195-741, Yazd, Iran SoltaniAfiliasi tidak diketahui1
Ali; Department of Mathematics, Islamic Azad University Yazd branch, Yazd, Iran SadeghiehAfiliasi tidak diketahui1
Nima; Department of Mathematics, Yazd University, 89195-741, Yazd, Iran. GhanbariAfiliasi tidak diketahui1

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 16 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">Some families of graphs with no nonzero real domination roots</dc:title>
	<dc:creator>Jahari, Somayeh; Department of Mathematics, Yazd University, 89195-741, Yazd, Iran</dc:creator>
	<dc:creator>Alikhani, Saeid; Department of Mathematics‎, ‎Yazd University‎, ‎89195-741‎, ‎Yazd‎, ‎Iran</dc:creator>
	<dc:subject xml:lang="en-US">domination polynomial, domination root, friendship, complex root.</dc:subject>
	<dc:description xml:lang="en-US">Let G be a simple graph of order n. The domination polynomial of G is the polynomial D(G, x) = ∑ni = γ(G)d(G, i)xi, where d(G, i) is the number of dominating sets of G of size i and γ(G) is the domination number of G. A root of D(G, x) is called a domination root of G. Obviously, 0 is a domination root of every graph G with multiplicity γ(G). In the study of the domination roots of graphs, this naturally raises the question: Which graphs have no nonzero real domination roots? In this paper we present some families of graphs whose have this property.</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>2018-04-03</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/400</dc:identifier>
	<dc:identifier>10.5614/ejgta.2018.6.1.2</dc:identifier>
	<dc:source xml:lang="en-US">Electronic Journal of Graph Theory and Applications (EJGTA); Vol 6, No 1 (2018): Electronic Journal of Graph Theory and Applications; 17-28</dc:source>
	<dc:source>2338-2287</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>http://www.ejgta.org/index.php/ejgta/article/view/400/pdf_62</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2018 Electronic Journal of Graph Theory and Applications (EJGTA)</dc:rights>
</oai_dc:dc>