Mostra el registre d'ítem simple
An eigenvalue characterization of antipodal distance-regular graphs
dc.contributor.author | Fiol Mora, Miquel Àngel |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV |
dc.date.accessioned | 2008-07-07T09:04:56Z |
dc.date.available | 2008-07-07T09:04:56Z |
dc.date.created | 1997 |
dc.date.issued | 1997-11 |
dc.identifier.citation | Fiol Mora, Miquel Àngel. An eigenvalue characterization of antipodal distance-regular graphs. The electronic journal of combinatorics, 1997, 4, 1, #R30 |
dc.identifier.issn | 1077-8926 |
dc.identifier.uri | http://hdl.handle.net/2117/2151 |
dc.description.abstract | Let $\Gamma$ be a regular (connected) graph with $n$ vertices and $d+1$ distinct eigenvalues. As a main result, it is shown that $\Gamma$ is an $r$-antipodal distance-regular graph if and only if the distance graph $\Gamma_d$ is constituted by disjoint coies of the complete graph $K_r$, with $r$ satisfying an expression in terms of $n$ and the distinct eigenvalues. |
dc.format.extent | 13 p. |
dc.language.iso | eng |
dc.subject.lcsh | Graph theory |
dc.subject.lcsh | Combinatorics |
dc.subject.other | Antipodal distance-regular graph |
dc.subject.other | Eigenvalues |
dc.subject.other | Alternating polynomials |
dc.title | An eigenvalue characterization of antipodal distance-regular graphs |
dc.type | Article |
dc.subject.lemac | Grafs, Teoria de |
dc.subject.lemac | Combinacions (Matemàtica) |
dc.contributor.group | Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
dc.description.peerreviewed | Peer Reviewed |
dc.subject.ams | Classificació AMS::05 Combinatorics::05C Graph theory |
dc.subject.ams | Classificació AMS::05 Combinatorics::05E Algebraic combinatorics |
dc.rights.access | Open Access |
local.personalitzacitacio | true |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [3.234]
-
Articles de revista [290]