Add to ORKGIn 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
In this paper we investigate the metric hierarchy for distance-regular graphs: in particular, we cla...
Let the Kneser graph K of a distance-regular graph G be the graph on the same vertex set as G, where...
Let the Kneser graph K of a distance-regular graph G be the graph on the same vertex set as G, where...
In this work we analyze regular boundary value problems on a distance-regular graph associated with ...
In this work we analyze regular boundary value problems on a distanceregular graph associated with S...
In this work we analyze regular boundary value problems on a distanceregular graph associated with ...
AbstractWe give a classification of graphs by two parameters s and t such that a graph is regular if...
AbstractIn this paper we investigate the metric hierarchy for distance-regular graphs: in particular...
AbstractIn this paper we investigate the metric hierarchy for distance-regular graphs: in particular...
AbstractIf A is the adjacency matrix of a graph G, then Ai is the adjacency matrix of the graph on t...
In this paper we investigate the metric hierarchy for distance-regular graphs: in particular, we cla...
In this paper we investigate the metric hierarchy for distance-regular graphs: in particular, we cla...
In this paper we investigate the metric hierarchy for distance-regular graphs: in particular, we cla...
In this paper we investigate the metric hierarchy for distance-regular graphs: in particular, we cla...
In this paper we investigate the metric hierarchy for distance-regular graphs: in particular, we cla...
In this paper we investigate the metric hierarchy for distance-regular graphs: in particular, we cla...
Let the Kneser graph K of a distance-regular graph G be the graph on the same vertex set as G, where...
Let the Kneser graph K of a distance-regular graph G be the graph on the same vertex set as G, where...
In this work we analyze regular boundary value problems on a distance-regular graph associated with ...
In this work we analyze regular boundary value problems on a distanceregular graph associated with S...
In this work we analyze regular boundary value problems on a distanceregular graph associated with ...
AbstractWe give a classification of graphs by two parameters s and t such that a graph is regular if...
AbstractIn this paper we investigate the metric hierarchy for distance-regular graphs: in particular...
AbstractIn this paper we investigate the metric hierarchy for distance-regular graphs: in particular...
AbstractIf A is the adjacency matrix of a graph G, then Ai is the adjacency matrix of the graph on t...
In this paper we investigate the metric hierarchy for distance-regular graphs: in particular, we cla...
In this paper we investigate the metric hierarchy for distance-regular graphs: in particular, we cla...
In this paper we investigate the metric hierarchy for distance-regular graphs: in particular, we cla...
In this paper we investigate the metric hierarchy for distance-regular graphs: in particular, we cla...
In this paper we investigate the metric hierarchy for distance-regular graphs: in particular, we cla...
In this paper we investigate the metric hierarchy for distance-regular graphs: in particular, we cla...
Let the Kneser graph K of a distance-regular graph G be the graph on the same vertex set as G, where...
Let the Kneser graph K of a distance-regular graph G be the graph on the same vertex set as G, where...