Title : ( Distance between the spectra of certain graphs )
Authors: Mohsen Alinejad , Kazem Khashyarmanesh , Mojgan Afkhami ,
دانلود فایل برای اعضای دانشگاهAccess to full-text not allowed by authors
Abstract
Richard Brualdi in [9] proposed the following problems: Problem A. Investigate cs(Gn) for special classes of graphs. Problem B. Find a good upper bound on csn. In this paper, we investigate problem A and determine cs(Gn), when Gn is a graph of order n with size two or three. Let Kn þ K1 be a disjoint union of the complete graph Kn with one isolated vertex, and K1 nþ1 be a complete graph Knþ1 by deleting n-1 edges from one vertex of K_n+1. We show that if \\\\\\\\\\\\\\\\lamda K_n+K1=cs(G_n), then G\\\\\\\\\\\\\\\'_n is isomorphic to K1 nþ1.
Keywords
, Spectra of graphs , Measures on spectra of graphs , Adjacency matrix of a graph
@article{paperid:1088117,
author = {Alinejad, Mohsen and Khashyarmanesh, Kazem and Mojgan Afkhami},
title = {Distance between the spectra of certain graphs},
journal = {Indian Journal of Pure and Applied Mathematics},
year = {2021},
volume = {52},
number = {2},
month = {June},
issn = {0019-5588},
pages = {548--557},
numpages = {9},
keywords = {Spectra of graphs ; Measures on spectra of graphs ; Adjacency matrix of a graph},
}
%0 Journal Article
%T Distance between the spectra of certain graphs
%A Alinejad, Mohsen
%A Khashyarmanesh, Kazem
%A Mojgan Afkhami
%J Indian Journal of Pure and Applied Mathematics
%@ 0019-5588
%D 2021
