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

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

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...

Ful tanımlama

Kaydedildi:
Detaylı Bibliyografya
Asıl Yazarlar: Ganie, Hilal A.; Department of Mathematics, University of Kashmir, Srinagar, Kashmir, India (Yazar), Samee, U.; Department of Mathematics, Islamia College for Science and Commerce, Srinagar, Kashmir, India (Yazar), Pirzada, S.; Department of Mathematics, University of Kashmir, Srinagar, Kashmir, India (Yazar), Alghamadi, Ahmad M.; Department of Mathematical Sciences, Umm Alqura University, Makkah, Saudi Arabia (Yazar)
Diğer Yazarlar: SERB-DST (İştirakçi)
Materyal Türü: EJournal Article
Baskı/Yayın Bilgisi: GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, 2019-10-10.
Konular:
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
Online Erişim:Get Fulltext
Etiketler: Etiketle
Etiket eklenmemiş, İlk siz ekleyin!

Internet

Get Fulltext

3rd Floor Main Library

Detaylı Erişim Bilgileri 3rd Floor Main Library
Yer Numarası: A1234.567
Kopya Bilgisi 1 Kütüphanede

Benzer Materyaller