Melola Discovery

← Melola Discovery

Jurnal SINTA 1

On energy, Laplacian energy and $p$-fold graphs

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

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

Abstrak

For a graph $G$ having adjacency spectrum ($A$-spectrum) $\lambda_n\leq\lambda_{n-1}\leq\cdots\leq\lambda_1$ and Laplacian spectrum ($L$-spectrum) $0=\mu_n\leq\mu_{n-1}\leq\cdots\leq\mu_1$, the energy is defined as $ E(G)=\sum_{i=1}^{n}|\lambda_i|$ and the Laplacian energy is defined as $LE(G)=\sum_{i=1}^{n}|\mu_i-\frac{2m}{n}|$. In this paper, we give upper and lower bounds for the energy of $KK_n^j,~1\leq j \leq n$ and as a consequence we generalize a result of Stevanovic et al. [More on the relation between Energy and Laplacian energy of graphs, MATCH Commun. Math. Comput. Chem. {\bf 61} (2009) 395-401]. We also consider strong double graph and strong $p$-fold graph to construct some new families of graphs $G$ for which $E(G)> LE(G)$.

Kata kunci

Jaringan kolaborasi para penulis

21 penulis · 33 tautan kepenulisan bersama · 6 lintas organisasi

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

  • Bandung Institute of Technology
  • Qatar University
  • Universitas Muhammadiyah Malang
  • Hasanuddin University
  • University of Indonesia
  • Politeknik Negeri Bandung
  • 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
Hilda AssiyatunBandung Institute of Technology2
Mir Riyaz; University of Kashmir Ul RashidAfiliasi tidak diketahui1
Edy Tri; Institut Teknologi Bandung BaskoroAfiliasi tidak diketahui1
Amir RehmanAfiliasi tidak diketahui1
Muhammad Ali; University of Calgary KhanAfiliasi tidak diketahui1
Zhou; Nanjing University GuofeiAfiliasi tidak diketahui1
Koko Kalambay KayibiQatar University1
Asmiati AsmiatiBandung Institute of Technology1
A.N.M. SalmanBandung Institute of Technology1
Hajo J. BroersmaBandung Institute of Technology1
Yus Mochamad CholilyUniversitas Muhammadiyah Malang1
Nurdin NurdinHasanuddin University1
Muhammad Kamran SiddiquiAfiliasi tidak diketahui1
Dian Kastika SyofyanBandung Institute of Technology1
Denny Riama SilabanUniversity of Indonesia1
Saladin UttunggadewaBandung Institute of Technology1
Anie LusianiPoliteknik Negeri Bandung1
Suhadi Wido SaputroBandung Institute of Technology1

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">On energy, Laplacian energy and $p$-fold graphs</dc:title>
	<dc:creator>Ganie, Hilal A; University of Kashmir</dc:creator>
	<dc:creator>Pirzada, Shariefuddin; University of Kashmir</dc:creator>
	<dc:creator>Baskoro, Edy Tri; ITB, Bandung</dc:creator>
	<dc:subject xml:lang="en-US">Spectra of graph; energy; Laplacian energy; strong double graph; strong $p$-fold graph</dc:subject>
	<dc:description xml:lang="en-US">For a graph $G$ having adjacency spectrum ($A$-spectrum) $\lambda_n\leq\lambda_{n-1}\leq\cdots\leq\lambda_1$ and Laplacian spectrum ($L$-spectrum) $0=\mu_n\leq\mu_{n-1}\leq\cdots\leq\mu_1$, the energy is defined as $ E(G)=\sum_{i=1}^{n}|\lambda_i|$ and the Laplacian energy is defined as $LE(G)=\sum_{i=1}^{n}|\mu_i-\frac{2m}{n}|$. In this paper, we give upper and lower bounds for the energy of $KK_n^j,~1\leq j \leq n$ and as a consequence we generalize a result of Stevanovic et al. [More on the relation between Energy and Laplacian energy of graphs, MATCH Commun. Math. Comput. Chem. {\bf 61} (2009) 395-401]. We also consider strong double graph and strong $p$-fold graph to construct some new families of graphs $G$ for which $E(G)&amp;gt; LE(G)$.</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/116</dc:identifier>
	<dc:identifier>10.5614/ejgta.2015.3.1.10</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; 94-107</dc:source>
	<dc:source>2338-2287</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>http://www.ejgta.org/index.php/ejgta/article/view/116/38</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2015 Electronic Journal of Graph Theory and Applications (EJGTA)</dc:rights>
</oai_dc:dc>