Sharif Digital Repository

A Deza graph with parameters (n, k, b, a) is a k-regular graph with n vertices such that any two of its vertices have b or a common neighbours, where b ≥ a. In this paper we investigate spectra of Deza graphs. In particular, using the eigenvalues of a Deza graph we determine the eigenvalues of its children. Divisible design graphs are significant cases of Deza graphs. Sufficient conditions for Deza graphs to be divisible design graphs are given, a few families of divisible design graphs are presented and their properties are studied. Our special attention goes to the invertibility of the adjacency matrices of Deza graphs. © 2020, © 2020 Informa UK Limited, trading as Taylor & Francis Group  

A Deza graph G with parameters (n,k,b,a) is a k-regular graph with n vertices such that any two distinct vertices have b or a common neighbours. The children GA and GB of a Deza graph G are defined on the vertex set of G such that every two distinct vertices are adjacent in GA or GB if and only if they have a or b common neighbours, respectively. A strongly Deza graph is a Deza graph with strongly regular children. In this paper we give a spectral characterisation of strongly Deza graphs, show relationships between eigenvalues, and study strongly Deza graphs which are distance-regular. © 2021 Elsevier B.V  

A Deza graph with parameters (Formula presented.) is a k-regular graph with n vertices such that any two of its vertices have b or a common neighbours, where (Formula presented.). In this paper we investigate spectra of Deza graphs. In particular, using the eigenvalues of a Deza graph we determine the eigenvalues of its children. Divisible design graphs are significant cases of Deza graphs. Sufficient conditions for Deza graphs to be divisible design graphs are given, a few families of divisible design graphs are presented and their properties are studied. Our special attention goes to the invertibility of the adjacency matrices of Deza graphs. © 2020 Informa UK Limited, trading as Taylor &... 

In this paper, we derive some necessary spectral conditions for the existence of graph homomorphisms in which we also consider some parameters related to the corresponding eigenspaces such as nodal domains. In this approach, we consider the combinatorial Laplacian and co-Laplacian as well as the adjacency matrix. Also, we present some applications in graph decompositions where we prove a general version of Fisher's inequality for G-designs. © 2006 Elsevier Inc. All rights reserved  

Governing equilibrium equations of thick-walled spherical vessels made of material following linear strain hardening and subjected to a steady-state radial temperature gradient using elasto-plastic analysis are derived. By considering a maximum plastic radius and using the concept of thermal autofrettage for the strengthening mechanism, the optimum wall thickness of the vessel for a given temperature gradient across the wall thickness is obtained. Finally, in the case of thermal loading on a vessel, the effect of convective heat transfer on the optimum thickness is studied and a general formula for the optimum wall thickness and design graphs for several different cases are presented. © 2008... 

Seepage analysis serves as one of the most significant stages in the design process of an embankment dam. In two-dimensional (2D) seepage analysis of embankment dams, little or no attention is paid to the seepage through side abutments. Moreover the role of grout curtain extensions into the side abutments and abutment material properties are inevitably neglected when performing a 2D seepage analysis. In this paper, two and three-dimensional (3D) models of a rockfill dam during operation state are generated and several unsteady and steady state seepage analyses are performed using finite element method (FEM). The results obtained from 2D and 3D seepage analyses were compared with measurements...