Parallelogram-Free Distance-Regular Graphs

descriptionPublicationkeyboard_double_arrow_right Article 01 Nov 1997 English Publisher:Elsevier BVJournal:Journal of Combinatorial Theory, Series B, volume 71, pages 231-243 (issn: 0095-8956,

Copyright policy )

Authors: Yuh-jeng Liang; Chih-Wen Weng;

doi: 10.1006/jctb.1997.1787

Parallelogram-Free Distance-Regular Graphs

- Summary
- Subjects
- Metrics

Abstract

This paper deals with distance-regular graphs. It is shown that a distance-regular graph with certain properties has classical parameters \((d,b,\alpha,\beta)\) with \(b<-1\). As a corollary, parallelogram-free distance-regular graphs with diameter \(d\geq 4\) and the \(Q\)-polynomial property can be characterized.

Related Organizations

National Chiao Tung University
Taiwan

Keywords

distance-regular graphs, parallelograms in graphs, Computational Theory and Mathematics, Association schemes, strongly regular graphs, Discrete Mathematics and Combinatorics, Theoretical Computer Science

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	3
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average

Found an issue? Give us feedback

3

Average

hybrid

Fields of Science (3) View all

Fields of Science