Jacobi matrices and boundary value problems in distance-regular graphs

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat Politècnica de Catalunya > Documents de recerca > View document

To access the full text documents, please follow this link: http://hdl.handle.net/2117/14821

dc.contributor	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada III
dc.contributor	Universitat Politècnica de Catalunya. VARIDIS - Varietats Riemannianes Discretes i Teoria del Potencial
dc.contributor	Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.contributor.author	Bendito Pérez, Enrique
dc.contributor.author	Carmona Mejías, Ángeles
dc.contributor.author	Encinas Bachiller, Andrés Marcos
dc.contributor.author	Gago Álvarez, Silvia
dc.date	2012-01-25
dc.identifier.citation	Bendito, E. [et al.]. "Jacobi matrices and boundary value problems in distance-regular graphs". 2012.
dc.identifier.uri	http://hdl.handle.net/2117/14821
dc.language.iso	eng
dc.relation	15A15, 15F10
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística::Àlgebra::Àlgebra lineal i multilineal
dc.subject	Matrices
dc.subject	Matrius (Matemàtica)
dc.subject	15 MATRIX THEORY
dc.title	Jacobi matrices and boundary value problems in distance-regular graphs
dc.type	info:eu-repo/semantics/draft
dc.type	info:eu-repo/semantics/report
dc.description.abstract	In this work we analyze regular boundary value problems on a distance-regular graph associated with SchrÄodinger operators. These problems include the cases in which the boundary has two or one vertices. Moreover, we obtain the Green matrix for each regular problem. In each case, the Green matrices are given in terms of two families of orthogonal polynomials one of them corresponding with the distance polynomials of the distance-regular graphs.

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author