Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Usama Waheed"'
Publikováno v:
Journal of Mathematics, Vol 2021 (2021)
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 adjac
Externí odkaz:
https://doaj.org/article/acca7c0a1b7b47e7b927ec7529ec8b2b
Publikováno v:
Complexity, Vol 2021 (2021)
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 conside
Externí odkaz:
https://doaj.org/article/23ae9a8cad4f4dad8a93c3fcd8a4f116
Global wheat production and productivity are facing threats due to recurring droughts caused by climate change. To combat these challenges, it is important to develop drought-tolerant wheat cultivars that can withstand drought and heat stress in marg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3ad7187a78297c336a8b97e081e50290
Publikováno v:
Journal of Mathematics, Vol 2021 (2021)
All graphs under consideration are finite, simple, connected, and undirected. Adjacency matrix of a graph G is 0,1 matrix A = a i j = 0 , i f v i = v j o r d v i , v j ≥ 2 1 , i f d v i , v j = 1. . Here in this paper, we discussed new type of adja
Publikováno v:
Complexity, Vol 2021 (2021)
Let G n , m represent the family of square power graphs of order n and size m , obtained from the family of graphs F n , k of order n and size k , with m ≥ k . In this paper, we discussed the least eigenvalue of graph G in the family G n , m c . Al