AbstractChatrand et al. [Graph similarity and distance in graphs, 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
AbstractPartial cubes are isometric subgraphs of hypercubes. Structures on a graph defined by means ...
We consider Euclidean distance graphs with vertex set ℚ2 or ℤ2 and address the possibility or impos...
This chapter describes distances between isomorphism classes or distances between graphs. An isomorp...
AbstractChatrand et al. [Graph similarity and distance in graphs, Aequationes Math. 55 (1998) 129–14...
Chatrand, Kubicki in Schultz [Aequationes Math. 55 (1998) 129-145] so postavili domnevo, da so vsi d...
Chatrand, Kubicki in Schultz [Aequationes Math. 55 (1998) 129-145] so postavili domnevo, da so vsi d...
AbstractWe give a characterization of connected subgraphs G of hypercubes H such that the distance i...
For a collection of graphs G, the distance graph of G is defined to be the graph containing a vertex...
summary:A distance between finite partially ordered sets is studied. It is a certain measure of the ...
AbstractWe classify distance-regular graphs that are isometrically embeddable into halved cube graph...
summary:A distance between finite partially ordered sets is studied. It is a certain measure of the ...
AbstractWe examine the class of distance regular graphs which can be embedded in a cube. We show tha...
This is a project for MTH 466, Graph Theory and Combinatorics. A graph is a mathematical object that...
Abstract: In this thesis we study and investigate bounds on distance measures in graphs and digraphs...
International audienceLet X ⊆ {0, 1} n. Then the daisy cube Q n (X) is introduced as the sub-graph o...
AbstractPartial cubes are isometric subgraphs of hypercubes. Structures on a graph defined by means ...
We consider Euclidean distance graphs with vertex set ℚ2 or ℤ2 and address the possibility or impos...
This chapter describes distances between isomorphism classes or distances between graphs. An isomorp...
AbstractChatrand et al. [Graph similarity and distance in graphs, Aequationes Math. 55 (1998) 129–14...
Chatrand, Kubicki in Schultz [Aequationes Math. 55 (1998) 129-145] so postavili domnevo, da so vsi d...
Chatrand, Kubicki in Schultz [Aequationes Math. 55 (1998) 129-145] so postavili domnevo, da so vsi d...
AbstractWe give a characterization of connected subgraphs G of hypercubes H such that the distance i...
For a collection of graphs G, the distance graph of G is defined to be the graph containing a vertex...
summary:A distance between finite partially ordered sets is studied. It is a certain measure of the ...
AbstractWe classify distance-regular graphs that are isometrically embeddable into halved cube graph...
summary:A distance between finite partially ordered sets is studied. It is a certain measure of the ...
AbstractWe examine the class of distance regular graphs which can be embedded in a cube. We show tha...
This is a project for MTH 466, Graph Theory and Combinatorics. A graph is a mathematical object that...
Abstract: In this thesis we study and investigate bounds on distance measures in graphs and digraphs...
International audienceLet X ⊆ {0, 1} n. Then the daisy cube Q n (X) is introduced as the sub-graph o...
AbstractPartial cubes are isometric subgraphs of hypercubes. Structures on a graph defined by means ...
We consider Euclidean distance graphs with vertex set ℚ2 or ℤ2 and address the possibility or impos...
This chapter describes distances between isomorphism classes or distances between graphs. An isomorp...