Merging the first and third classes in bipartite distance-regular graphs
2019 ◽
Vol 12
(07)
◽
pp. 2050009
Keyword(s):
Merging the first and third classes in a connected graph is the operation of adding edges between all vertices at distance 3 in the original graph while keeping the original edges. We determine when merging the first and third classes in a bipartite distance-regular graph produces a distance-regular graph.
Keyword(s):
2001 ◽
Vol 10
(2)
◽
pp. 127-135
◽
2000 ◽
Vol 23
(2)
◽
pp. 89-97
◽