Melola Discovery

← Melola Discovery

Jurnal SINTA 1

Computation of the eigenvalues of complete signed graphs

Electronic Journal of Graph Theory and Applications · Vol. 14 No. 1 (2026) · hlm. 245–256

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

Abstrak

A signed graph Σ is the ordered pair (G,σ), where G=(V,E) is a finite simple graph, called the underlying graph, and σ: E(G) → {+1, -1} is a sign function or a signature of Σ. Let (K_n,σ) be a complete signed graph with n vertices. In this paper, we give a complete description of the adjacency, Laplacian and net Laplacian spectrum of a complete signed graph (K_n,σ) whenever its negative edges induce either a complete tripartite graph or a friendship graph. This is an addition to the class of complete signed graphs whose spectra is completely known.

Kata kunci

Jaringan kolaborasi para penulis

23 penulis · 40 tautan kepenulisan bersama

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

  • Bandung Institute of Technology
  • Qatar University
  • 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
Rinovia; Institut Teknologi Bandung SimanjuntakAfiliasi tidak diketahui2
Hilal A; University of Kashmir GanieAfiliasi tidak diketahui1
Edy Tri BaskoroBandung Institute of Technology1
Ketut Queena; Institut Teknologi Bandung FredlinaAfiliasi tidak diketahui1
Pritta Etriana; Institut Teknologi Bandung PutriAfiliasi tidak diketahui1
Yusuf; Institut Teknologi Bandung HafidhAfiliasi tidak diketahui1
Devi Imulia Dian; The University of Melbourne PrimaskunAfiliasi tidak diketahui1
Faisal; Institut Teknologi Bandung SusantoAfiliasi tidak diketahui1
Mostafa; Ferdowsi University of Mashhad TavakoliAfiliasi tidak diketahui1
Meysam; Ferdowsi University of Mashhad KorivandAfiliasi tidak diketahui1
Ahmad; Ferdowsi University of Mashhad ErfanianAfiliasi tidak diketahui1
Gholamreza; Ferdowsi University of Mashhad AbrishamiAfiliasi tidak diketahui1
Muhammad Ali; University of Calgary KhanAfiliasi tidak diketahui1
Zhou; Nanjing University GuofeiAfiliasi tidak diketahui1
Koko Kalambay KayibiQatar University1
Muhammad; Institut Teknologi Bandung RidwanAfiliasi tidak diketahui1
Hilda; Institut Teknologi Bandung AssiyatunAfiliasi tidak diketahui1
Anak Agung Gede; Universitas Merdeka Malang NgurahAfiliasi tidak diketahui1
A; Institut Teknologi Bandung AsmiatiAfiliasi 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 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">Computation of the eigenvalues of complete signed graphs</dc:title>
	<dc:creator>Pirzada, Shariefuddin; University of Kashmir</dc:creator>
	<dc:creator>Ul Rashid, Mir Riyaz; University of Kashmir</dc:creator>
	<dc:creator>Rehman, Amir</dc:creator>
	<dc:creator>Baskoro, Edy Tri; Institut Teknologi Bandung</dc:creator>
	<dc:subject xml:lang="en-US">complete signed graph; complete tripartite graph; friendship graph; spectrum; Laplacian spectrum; net Laplacian spectrum</dc:subject>
	<dc:subject xml:lang="en-US">05C22; 05C50</dc:subject>
	<dc:description xml:lang="en-US">A signed graph Σ is the ordered pair (G,σ), where G=(V,E) is a finite simple graph, called the underlying graph, and σ: E(G) → {+1, -1} is a sign function or a signature of Σ. Let (K_n,σ) be a complete signed graph with n vertices. In this paper, we give a complete description of the adjacency, Laplacian and net Laplacian spectrum of a complete signed graph (K_n,σ) whenever its negative edges induce either a complete tripartite graph or a friendship graph. This is an addition to the class of complete signed graphs whose spectra is completely known.</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>2026-04-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/2379</dc:identifier>
	<dc:identifier>10.5614/ejgta.2026.14.1.16</dc:identifier>
	<dc:source xml:lang="en-US">Electronic Journal of Graph Theory and Applications (EJGTA); Vol 14, No 1 (2026): Electronic Journal of Graph Theory and Applications; 245 - 256</dc:source>
	<dc:source>2338-2287</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>http://www.ejgta.org/index.php/ejgta/article/view/2379/pdf_359</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2026 Electronic Journal of Graph Theory and Applications (EJGTA)</dc:rights>
</oai_dc:dc>