Melola Discovery

← Melola Discovery

Jurnal SINTA 1

Bounds for graph energy in terms of vertex covering and clique numbers

Electronic Journal of Graph Theory and Applications · Vol. 7 No. 2 (2019) · hlm. 315–328

DOI
10.5614/ejgta.2019.7.2.9
ISSN
2338-2287
Terbit
2019-10-10
Penerbit
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
Bahasa
eng

Abstrak

Let G be a simple graph with n vertices, m edges and having adjacency eigenvalues λ1, λ2, …, λn. The energy E(G) of the graph G is defined as E(G) = ∑i = 1n∣λi∣. In this paper, we obtain the upper bounds for the energy E(G) in terms of the vertex covering number τ, the clique number ω, the number of edges m, maximum vertex degree d1 and second maximum vertex degree d2 of the connected graph G. These upper bounds improve some of the recently known upper bounds.

Kata kunci

Jaringan kolaborasi para penulis

9 penulis · 15 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
Shariefuddin; Department of Mathematics, University of Kashmir, Srinagar, Kashmir, India PirzadaAfiliasi tidak diketahui1
Merajuddin; Department of Applied Mathematics, Aligarh Muslim University, Aligarh, India SiddiqueAfiliasi tidak diketahui1
Bilal A.; Department of Mathematics, University of Kashmir, Srinagar, Kashmir, India RatherAfiliasi tidak diketahui1
T. A.; Department of Mathematics, University of Kashmir, Srinagar, Kashmir, India ChishtiAfiliasi tidak diketahui1
U.; Department of Mathematics, University of Kashmir, Srinagar, Kashmir, India SameeAfiliasi 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">Bounds for graph energy in terms of vertex covering and clique numbers</dc:title>
	<dc:creator>Ganie, Hilal A.; Department of Mathematics, University of Kashmir, Srinagar, Kashmir, India</dc:creator>
	<dc:creator>Samee, U.; Department of Mathematics, Islamia College for Science and Commerce, Srinagar, Kashmir, India</dc:creator>
	<dc:creator>Pirzada, S.; Department of Mathematics, University of Kashmir, Srinagar, Kashmir, India</dc:creator>
	<dc:creator>Alghamadi, Ahmad M.; Department of Mathematical Sciences, Umm Alqura University, Makkah, Saudi Arabia</dc:creator>
	<dc:subject xml:lang="en-US">graph energy, vertex covering number, clique number, maximum degree</dc:subject>
	<dc:description xml:lang="en-US">Let G be a simple graph with n vertices, m edges and having adjacency eigenvalues λ1, λ2, …, λn. The energy E(G) of the graph G is defined as E(G) = ∑i = 1n∣λi∣. In this paper, we obtain the upper bounds for the energy E(G) in terms of the vertex covering number τ, the clique number ω, the number of edges m, maximum vertex degree d1 and second maximum vertex degree d2 of the connected graph G. These upper bounds improve some of the recently known upper bounds.</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">SERB-DST</dc:contributor>
	<dc:date>2019-10-10</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/667</dc:identifier>
	<dc:identifier>10.5614/ejgta.2019.7.2.9</dc:identifier>
	<dc:source xml:lang="en-US">Electronic Journal of Graph Theory and Applications (EJGTA); Vol 7, No 2 (2019): Electronic Journal of Graph Theory and Applications; 315 - 328</dc:source>
	<dc:source>2338-2287</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>http://www.ejgta.org/index.php/ejgta/article/view/667/pdf_113</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2019 Electronic Journal of Graph Theory and Applications (EJGTA)</dc:rights>
</oai_dc:dc>