The Optimal Graph Whose Least Eigenvalue is Minimal among All Graphs via 1-2 Adjacency Matrix

Lubna Gul, Gohar Ali, Usama Waheed, Nudrat Aamir and Elena Guardo

Journal of Mathematics, 2021, vol. 2021, 1-4

Abstract: All graphs under consideration are finite, simple, connected, and undirected. Adjacency matrix of a graph G is 0,1 matrix A=aij=0, if vi=vj or  dvi,vj≥21, if  dvi,vj=1.. Here in this paper, we discussed new type of adjacency matrix known by 1-2 adjacency matrix defined as A1,2G=aij=0, if vi=vj or  dvi,vj≥31, if  dvi,vj=2, from eigenvalues of the graph, we mean eigenvalues of the 1-2 adjacency matrix. Let Tnc be the set of the complement of trees of order n. In this paper, we characterized a unique graph whose least eigenvalue is minimal among all the graphs in Tnc.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2021/8016237.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2021/8016237.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:jjmath:8016237

DOI: 10.1155/2021/8016237

Access Statistics for this article

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