Some spectral and quasi-spectral characterizations of distance-regular graphs

Aida Abiad Monge; M.A. Fiol; Edwin R. van Dam

doi:10.1016/j.jcta.2016.04.004

Some spectral and quasi-spectral characterizations of distance-regular graphs

Aida Abiad Monge
, M.A. Fiol
, Edwin R. van Dam

Research output: Contribution to journal › Article › Academic › peer-review

7 Citations (Scopus)

Abstract

In this paper we consider the concept of preintersection numbers of a graph. These numbers are determined by the spectrum of the adjacency matrix of the graph, and generalize the intersection numbers of a distance-regular graph. By using the preintersection numbers we give some new spectral and quasi-spectral characterizations of distance-regularity, in particular for graphs with large girth or large odd-girth.

Original language	English
Pages (from-to)	1-18
Journal	Journal of Combinatorial Theory, Series A
Volume	143
DOIs	https://doi.org/10.1016/j.jcta.2016.04.004
Publication status	Published - 2016
Externally published	Yes

Access to Document

10.1016/j.jcta.2016.04.004

Cite this

@article{96398b5632bb4ec59292e11f1574d2f6,

title = "Some spectral and quasi-spectral characterizations of distance-regular graphs",

abstract = "In this paper we consider the concept of preintersection numbers of a graph. These numbers are determined by the spectrum of the adjacency matrix of the graph, and generalize the intersection numbers of a distance-regular graph. By using the preintersection numbers we give some new spectral and quasi-spectral characterizations of distance-regularity, in particular for graphs with large girth or large odd-girth.",

author = "\{Abiad Monge\}, Aida and M.A. Fiol and \{van Dam\}, \{Edwin R.\}",

year = "2016",

doi = "10.1016/j.jcta.2016.04.004",

language = "English",

volume = "143",

pages = "1--18",

journal = "Journal of Combinatorial Theory, Series A",

issn = "0097-3165",

publisher = "Academic Press Inc.",

}

TY - JOUR

T1 - Some spectral and quasi-spectral characterizations of distance-regular graphs

AU - Abiad Monge, Aida

AU - Fiol, M.A.

AU - van Dam, Edwin R.

PY - 2016

Y1 - 2016

N2 - In this paper we consider the concept of preintersection numbers of a graph. These numbers are determined by the spectrum of the adjacency matrix of the graph, and generalize the intersection numbers of a distance-regular graph. By using the preintersection numbers we give some new spectral and quasi-spectral characterizations of distance-regularity, in particular for graphs with large girth or large odd-girth.

AB - In this paper we consider the concept of preintersection numbers of a graph. These numbers are determined by the spectrum of the adjacency matrix of the graph, and generalize the intersection numbers of a distance-regular graph. By using the preintersection numbers we give some new spectral and quasi-spectral characterizations of distance-regularity, in particular for graphs with large girth or large odd-girth.

U2 - 10.1016/j.jcta.2016.04.004

DO - 10.1016/j.jcta.2016.04.004

M3 - Article

SN - 0097-3165

VL - 143

SP - 1

EP - 18

JO - Journal of Combinatorial Theory, Series A

JF - Journal of Combinatorial Theory, Series A

ER -

Some spectral and quasi-spectral characterizations of distance-regular graphs

Abstract

Access to Document

Fingerprint

Cite this