Melola Discovery

← Melola Discovery

Jurnal SINTA 1

‎Distinguishing index of Kronecker product of two graphs

Electronic Journal of Graph Theory and Applications · Vol. 9 No. 1 (2021) · hlm. 77–85

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

Abstrak

The distinguishing index D'(G) of a graph G is the least integer d such that G has an edge labeling with d labels that is preserved only by a trivial automorphism. The Kronecker product G x H of two graphs G and H is the graph with vertex set V(G) x V(H) and edge set {{(u,x), (v,y)} |{u,v} ∈ E(G) and {x,y} ∈ E(H)}. In this paper we study the distinguishing index of Kronecker product of two graphs.

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
Somayeh; Department of Mathematics, Yazd University, 89195-741, Yazd, Iran JahariAfiliasi 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">‎Distinguishing index of Kronecker product of two graphs</dc:title>
	<dc:creator>Alikhani, ‎Saeid; Department of Mathematics, Yazd University, 89195-741, Yazd, Iran</dc:creator>
	<dc:creator>Soltani, Samaneh; Department of Mathematics, Yazd University, 89195-741, Yazd, Iran</dc:creator>
	<dc:subject xml:lang="en-US">distinguishing number, distinguishing index, Kronecker product</dc:subject>
	<dc:subject xml:lang="en-US">05C15, 05C60</dc:subject>
	<dc:description xml:lang="en-US">The distinguishing index D'(G)  of a graph G is the least integer d such that G has an edge labeling with d labels that is preserved only by a trivial automorphism. The Kronecker product G x H of two graphs G and H is the graph with vertex set V(G) x V(H) and edge set {{(u,x), (v,y)} |{u,v} ∈ E(G) and {x,y} ∈  E(H)}. In this paper we study the distinguishing index of Kronecker product of two graphs. </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>2021-04-15</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/338</dc:identifier>
	<dc:identifier>10.5614//ejgta.2021.9.1.7</dc:identifier>
	<dc:source xml:lang="en-US">Electronic Journal of Graph Theory and Applications (EJGTA); Vol 9, No 1 (2021): Electronic Journal of Graph Theory and Applications; 77 - 85</dc:source>
	<dc:source>2338-2287</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>http://www.ejgta.org/index.php/ejgta/article/view/338/pdf_162</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2021 Electronic Journal of Graph Theory and Applications (EJGTA)</dc:rights>
</oai_dc:dc>