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

Deskribapen osoa

Gorde:
Xehetasun bibliografikoak
Egile Nagusiak: Ganie, Hilal A.; Department of Mathematics, University of Kashmir, Srinagar, Kashmir, India (Egilea), Samee, U.; Department of Mathematics, Islamia College for Science and Commerce, Srinagar, Kashmir, India (Egilea), Pirzada, S.; Department of Mathematics, University of Kashmir, Srinagar, Kashmir, India (Egilea), Alghamadi, Ahmad M.; Department of Mathematical Sciences, Umm Alqura University, Makkah, Saudi Arabia (Egilea)
Beste egile batzuk: SERB-DST (Laguntzailea)
Formatua: EJournal Article
Argitaratua: GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, 2019-10-10.
Gaiak:
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
Sarrera elektronikoa:Get Fulltext
Etiketak: Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!

Internet

Get Fulltext

3rd Floor Main Library

Aleari buruzko argibideak 3rd Floor Main Library
Sailkapena: A1234.567
Alea 1 Eskuragarri

Antzeko izenburuak