• Title/Summary/Keyword: Adjacency spectrum

Search Result 3, Processing Time 0.017 seconds

THE SPECTRAL DETERMINATIONS OF THE JOIN OF TWO FRIENDSHIP GRAPHS

  • Abdian, Ali Zeydi;Moez, Amirhossein Morovati
    • Honam Mathematical Journal
    • /
    • v.41 no.1
    • /
    • pp.67-87
    • /
    • 2019
  • The main aim of this study is to characterize new classes of multicone graphs which are determined by their adjacency spectra, their Laplacian spectra, their complement with respect to signless Laplacian spectra and their complement with respect to their adjacency spectra. A multicone graph is defined to be the join of a clique and a regular graph. If n is a positive integer, a friendship graph $F_n$ consists of n edge-disjoint triangles that all of them meet in one vertex. It is proved that any connected graph cospectral to a multicone graph $F_n{\nabla}F_n=K_2{\nabla}nK_2{\nabla}nK_2$ is determined by its adjacency spectra as well as its Laplacian spectra. In addition, we show that if $n{\neq}2$, the complement of these graphs are determined by their adjacency spectra. At the end of the paper, it is proved that multicone graphs $F_n{\nabla}F_n=K_2{\nabla}nK_2{\nabla}nK_2$ are determined by their signless Laplacian spectra and also we prove that any graph cospectral to one of multicone graphs $F_n{\nabla}F_n$ is perfect.

DIRECTED STRONGLY REGULAR GRAPHS AND THEIR CODES

  • Alahmadi, Adel;Alkenani, Ahmad;Kim, Jon-Lark;Shi, Minjia;Sole, Patrick
    • Bulletin of the Korean Mathematical Society
    • /
    • v.54 no.2
    • /
    • pp.497-505
    • /
    • 2017
  • The rank over a finite field of the adjacency matrix of a directed strongly regular graph is studied, with some applications to the construction of linear codes. Three techniques are used: code orthogonality, adjacency matrix determinant, and adjacency matrix spectrum.

The Gallai and Anti-Gallai Graphs of Strongly Regular Graphs

  • Jeepamol J. Palathingal;Aparna Lakshmanan S.;Greg Markowsky
    • Kyungpook Mathematical Journal
    • /
    • v.64 no.1
    • /
    • pp.171-184
    • /
    • 2024
  • In this paper, we show that if G is strongly regular then the Gallai graph Γ(G) and the anti-Gallai graph ∆(G) of G are edge-regular. We also identify conditions under which the Gallai and anti-Gallai graphs are themselves strongly regular, as well as conditions under which they are 2-connected. We include also a number of concrete examples and a discussion of spectral properties of the Gallai and anti-Gallai graphs.