RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제
      • 무료
      • 기관 내 무료
      • 유료
      • KCI등재

        The spectral determinations of the join of two friendship graphs

        Ali Zeydi Abdian,Amirhossein Morovati Moez 호남수학회 2019 호남수학학술지 Vol.41 No.1

        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\bigtriangledown F_n=K_2\bigtriangledown nK_2\bigtriangledown 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\bigtriangledown F_n=K_2\bigtriangledown nK_2\bigtriangledown nK_2 $ are determined by their signless Laplacian spectra and also we prove that any graph cospectral to one of multicone graphs $ F_n\bigtriangledown F_n $ is perfect.

      • KCI등재

        THE SPECTRAL DETERMINATIONS OF THE JOIN OF TWO FRIENDSHIP GRAPHS

        Abdian, Ali Zeydi,Moez, Amirhossein Morovati The Honam Mathematical Society 2019 호남수학학술지 Vol.41 No.1

        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.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼