The Optimal Graph Whose Least Eigenvalue is Minimal among All Graphs via 1-2 Adjacency Matrix
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 d...
Guardado en:
Autores principales: | Lubna Gul, Gohar Ali, Usama Waheed, Nudrat Aamir |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Hindawi Limited
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/acca7c0a1b7b47e7b927ec7529ec8b2b |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Finite groups whose intersection power graphs are toroidal and projective-planar
por: Li Huani, et al.
Publicado: (2021) -
Universal adjacency spectrum of zero divisor graph on the ring and its complement
por: Saraswati Bajaj, et al.
Publicado: (2021) -
On graphs whose chromatic transversal number is two
por: Ayyaswamy,S.K, et al.
Publicado: (2011) -
Open problems on graph eigenvalues studied with AutoGraphiX
por: Mustapha Aouchiche, et al.
Publicado: (2013) -
Graph limits and exchangeable random graphs
por: Persi Diaconis, et al.
Publicado: (2008)