The Least Eigenvalue of the Complement of the Square Power Graph of G

Lubna Gul, Gohar Ali, Usama Waheed, Sumiya Nasir and Muhammad Javaid

Complexity, 2021, vol. 2021, 1-4

Abstract: Let Gn,m represent the family of square power graphs of order n and size m, obtained from the family of graphs Fn,k of order n and size k, with m≥k. In this paper, we discussed the least eigenvalue of graph G in the family Gn,mc. All graphs considered here are undirected, simple, connected, and not a complete Kn for positive integer n.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/complexity/2021/5885834.pdf (application/pdf)
http://downloads.hindawi.com/journals/complexity/2021/5885834.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:5885834

DOI: 10.1155/2021/5885834

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().