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

पूर्ण विवरण

में बचाया:
ग्रंथसूची विवरण
मुख्य लेखकों: Ganie, Hilal A.; Department of Mathematics, University of Kashmir, Srinagar, Kashmir, India (लेखक), Samee, U.; Department of Mathematics, Islamia College for Science and Commerce, Srinagar, Kashmir, India (लेखक), Pirzada, S.; Department of Mathematics, University of Kashmir, Srinagar, Kashmir, India (लेखक), Alghamadi, Ahmad M.; Department of Mathematical Sciences, Umm Alqura University, Makkah, Saudi Arabia (लेखक)
अन्य लेखक: SERB-DST (अंशदाता)
स्वरूप: EJournal Article
प्रकाशित: GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, 2019-10-10.
विषय:
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
ऑनलाइन पहुंच:Get Fulltext
टैग : टैग जोड़ें
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!

इंटरनेट

Get Fulltext

3rd Floor Main Library

होल्डिंग्स विवरण से 3rd Floor Main Library
बोधानक: A1234.567
प्रति 1 उपलब्ध

समान संसाधन