Chatrand, Kubicki in Schultz [Aequationes Math. 55 (1998) 129-145] so postavili domnevo, da so vsi dvodelni grafi razdaljni grafi. V tem članku pokažemo, da so vsi grafi podmnožice dvodelnih grafov, in sicer delne kocke, razdaljni grafi.Chatrand, Kubicki and Schultz [Aequationes Math. 55 (1998) 129-145] have recently conjectured that all bipartite graphs are distance graphs. Here we show that all graphs of a large subclass of bipartite graphs, i.e. partial cubes, are distance graphs
Let G be a bipartite distance-regular graph with bipartition V(G) = X ∪ Y. Let V(G′) = X and, for x ...
We construct two families of distance-regular graphs, namely the subgraph of the dual polar graph of...
A connected graph ▫$varGamma$▫ is said to be distance-balanced whenever for any pair of adjacent ver...
Chatrand, Kubicki in Schultz [Aequationes Math. 55 (1998) 129-145] so postavili domnevo, da so vsi d...
AbstractChatrand et al. [Graph similarity and distance in graphs, Aequationes Math. 55 (1998) 129–14...
AbstractChatrand et al. [Graph similarity and distance in graphs, Aequationes Math. 55 (1998) 129–14...
For a collection of graphs G, the distance graph of G is defined to be the graph containing a vertex...
Tema ovog diplomskog rada su distancijsko regularni grafovi. Rad se sastoji od četiri poglavlja i do...
Tema ovog diplomskog rada su distancijsko regularni grafovi. Rad se sastoji od četiri poglavlja i do...
Tema ovog diplomskog rada su distancijsko regularni grafovi. Rad se sastoji od četiri poglavlja i do...
The main result of this article is a classification of distance-regular Cayley graphs on dihedral gr...
V diplomskem delu sta obravnavana razreda razdaljno uravnoteženih in krepko razdaljno uravnoteženih ...
One problem with the theory of distance-regular graphs is that it does not apply directly to the gra...
The main result of this article is a classification of distance-regular Cayley graphs on dihedral gr...
We construct two families of distance-regular graphs, namely the subgraph of the dual polar graph of...
Let G be a bipartite distance-regular graph with bipartition V(G) = X ∪ Y. Let V(G′) = X and, for x ...
We construct two families of distance-regular graphs, namely the subgraph of the dual polar graph of...
A connected graph ▫$varGamma$▫ is said to be distance-balanced whenever for any pair of adjacent ver...
Chatrand, Kubicki in Schultz [Aequationes Math. 55 (1998) 129-145] so postavili domnevo, da so vsi d...
AbstractChatrand et al. [Graph similarity and distance in graphs, Aequationes Math. 55 (1998) 129–14...
AbstractChatrand et al. [Graph similarity and distance in graphs, Aequationes Math. 55 (1998) 129–14...
For a collection of graphs G, the distance graph of G is defined to be the graph containing a vertex...
Tema ovog diplomskog rada su distancijsko regularni grafovi. Rad se sastoji od četiri poglavlja i do...
Tema ovog diplomskog rada su distancijsko regularni grafovi. Rad se sastoji od četiri poglavlja i do...
Tema ovog diplomskog rada su distancijsko regularni grafovi. Rad se sastoji od četiri poglavlja i do...
The main result of this article is a classification of distance-regular Cayley graphs on dihedral gr...
V diplomskem delu sta obravnavana razreda razdaljno uravnoteženih in krepko razdaljno uravnoteženih ...
One problem with the theory of distance-regular graphs is that it does not apply directly to the gra...
The main result of this article is a classification of distance-regular Cayley graphs on dihedral gr...
We construct two families of distance-regular graphs, namely the subgraph of the dual polar graph of...
Let G be a bipartite distance-regular graph with bipartition V(G) = X ∪ Y. Let V(G′) = X and, for x ...
We construct two families of distance-regular graphs, namely the subgraph of the dual polar graph of...
A connected graph ▫$varGamma$▫ is said to be distance-balanced whenever for any pair of adjacent ver...