Publication date
January 2008
DOIAbstract
In this note we show that there is a unique distance-regular graph with intersection array {280, 243, 144, 10 ; 1, 8, 90, 280}. © 2008 Elsevier Inc. All rights reserved
In this note we show that there is a unique distance-regular graph with intersection array {280, 243, 144, 10 ; 1, 8, 90, 280}. © 2008 Elsevier Inc. All rights reserved
We give four descriptions of the distance regular graph with 102 vertices, diameter 7 and girth 9 fo...
We give four descriptions of the distance regular graph with 102 vertices, diameter 7 and girth 9 fo...
AbstractThe problem of deciding whether a distance-regular graph with a given set of parameters exis...
In this note we show that there is a unique distance-regular graph with intersection array {280, 243...
In this note we show that there is a unique distance-regular graph with intersection array {280, 243...
In this note we show that there is a unique distance-regular graph with intersection array {280, 243...
AbstractIn this note we show that there is a unique distance-regular graph with intersection array {...
We give an inequality on the parameters of distance regular graphs, and show the geometric consequen...
We give an inequality on the parameters of distance regular graphs, and show the geometric consequen...
We give an inequality on the parameters of distance regular graphs, and show the geometric consequen...
We give an inequality on the parameters of distance regular graphs, and show the geometric consequen...
AbstractWe show that a distance regular graph Γ with intersection array (21,16,8;1,4,14) does not ex...
We prove that the arrays {52, 35, 16; 1, 4, 28} and {69, 48, 24; 1, 4, 46} cannot be realized as the...
We give four descriptions of the distance regular graph with 102 vertices, diameter 7 and girth 9 fo...
We give four descriptions of the distance regular graph with 102 vertices, diameter 7 and girth 9 fo...
We give four descriptions of the distance regular graph with 102 vertices, diameter 7 and girth 9 fo...
We give four descriptions of the distance regular graph with 102 vertices, diameter 7 and girth 9 fo...
AbstractThe problem of deciding whether a distance-regular graph with a given set of parameters exis...
In this note we show that there is a unique distance-regular graph with intersection array {280, 243...
In this note we show that there is a unique distance-regular graph with intersection array {280, 243...
In this note we show that there is a unique distance-regular graph with intersection array {280, 243...
AbstractIn this note we show that there is a unique distance-regular graph with intersection array {...
We give an inequality on the parameters of distance regular graphs, and show the geometric consequen...
We give an inequality on the parameters of distance regular graphs, and show the geometric consequen...
We give an inequality on the parameters of distance regular graphs, and show the geometric consequen...
We give an inequality on the parameters of distance regular graphs, and show the geometric consequen...
AbstractWe show that a distance regular graph Γ with intersection array (21,16,8;1,4,14) does not ex...
We prove that the arrays {52, 35, 16; 1, 4, 28} and {69, 48, 24; 1, 4, 46} cannot be realized as the...
We give four descriptions of the distance regular graph with 102 vertices, diameter 7 and girth 9 fo...
We give four descriptions of the distance regular graph with 102 vertices, diameter 7 and girth 9 fo...
We give four descriptions of the distance regular graph with 102 vertices, diameter 7 and girth 9 fo...
We give four descriptions of the distance regular graph with 102 vertices, diameter 7 and girth 9 fo...
AbstractThe problem of deciding whether a distance-regular graph with a given set of parameters exis...
Add to ORKG