Now showing items 1-4 of 4
A Galois connection of algebraic relations and colored resets
Mathematical solutions of electric potential and magnetic field reponse from heterogeneous media
Feasibility of distance-regular graphs
The problem of deciding whether a distance-regular graph with a given intersection array exists is a widely studied topic in distance-regular graphs. In 1989 Brouwer, Cohen and Neumaier have compiled a list of intersection ...
Merging in bipartite distance-regular graphs
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.Merging the first m classes in a connected ...