64 research outputs found

    On strictly Deza graphs with parameters (n,k,k-1,a)

    Full text link
    A nonempty kk-regular graph Γ\Gamma on nn vertices is called a Deza graph if there exist constants bb and aa (ba)(b \geq a) such that any pair of distinct vertices of Γ\Gamma has precisely either bb or aa common neighbours. The quantities nn, kk, bb, and aa are called the parameters of Γ\Gamma and are written as the quadruple (n,k,b,a)(n,k,b,a). If a Deza graph has diameter 2 and is not strongly regular, then it is called a strictly Deza graph. In the paper we investigate strictly Deza graphs with parameters (n,k,b,a) (n, k, b, a) , where its quantities satisfy the conditions k=b+1k = b + 1 and k(k1)a(n1)ba>1\frac{k(k - 1) - a(n - 1)}{b - a} > 1.Comment: Any comments or suggestions are very welcom

    Plasmonic waveguides cladded by hyperbolic metamaterials

    Full text link
    Strongly anisotropic media with hyperbolic dispersion can be used for claddings of plasmonic waveguides. In order to analyze the fundamental properties of such waveguides, we analytically study 1D waveguides arranged of a hyperbolic metamaterial (HMM) in a HMM-Insulator-HMM (HIH) structure. We show that hyperbolic metamaterial claddings give flexibility in designing the properties of HIH waveguides. Our comparative study on 1D plasmonic waveguides reveals that HIH-type waveguides can have a higher performance than MIM or IMI waveguides

    Spectra of strongly Deza graphs

    Get PDF
    A Deza graph GG with parameters (n,k,b,a)(n,k,b,a) is a kk-regular graph with nn vertices such that any two distinct vertices have bb or aa common neighbours. The children GAG_A and GBG_B of a Deza graph GG are defined on the vertex set of GG such that every two distinct vertices are adjacent in GAG_A or GBG_B if and only if they have aa or bb 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
    corecore