Distance-Regular Graphs of Type E1?Ed with a Generalized Feasible Cosine Sequence
Received:February 21, 2003  
Key Words: distance-regular graphs   generalized feasible cosine sequence   distance-regular graphs of type E1?Ed.  
Fund Project:
Author NameAffiliation
GAO Suo-gang Dept. of Math.
Hebei Normal University
Shijiazhuang
China 
Hits: 2232
Download times: 1195
Abstract:
      In this paper, we characterize the distance-regular graphs of type E1?Ed with a generalized feasible cosine sequence, and obtain the intersection numbers of these graphs.
Citation:
DOI:10.3770/j.issn:1000-341X.2004.04.023
View Full Text  View/Add Comment  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.