Search

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 marginal production environments. This can be achieved by exploring wheat crops inherent genetic variations and environmental adaptations. Understanding the various mechanisms such as genetics, physiology, biochemistry, and environment and their interactions is crucial in improving drought tolerance in wheat. This paper will summarize the genetic gains and future perspectives in breeding drought-tolerant wheat. This information will serve as a valuable resource for wheat breeders and agronomists to guide the developing and deploying high-performing, drought-adapted wheat varieties. &nbsp

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 adjacency matrix known by 1-2 adjacency matrix defined as A 1,2 G = a i j = 0 , i f v i = v j o r d v i , v j ≥ 3 1 , i f d v i , v j = 2 , from eigenvalues of the graph, we mean eigenvalues of the 1-2 adjacency matrix. Let T n c 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 T n c .

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 . All graphs considered here are undirected, simple, connected, and not a complete K n for positive integer n .