AbstractIn this paper, we are interested in some metric properties of graphs. In particular, we investigate distance monotonicity in graphs. Straightaway, we revisit the notion of distance monotonicity. We then introduce interval distance monotone graphs, graphs which are not distance monotone but whose intervals are distance monotone. Finally, we obtain a new characterization of hypercubes involving this notion
AbstractWe classify distance-regular graphs that are isometrically embeddable into halved cube graph...
AbstractA generalized hypercube Qd(S) (S ⊆ {1, 2, …, d}) has {0,1}d as vertex set and two vertices a...
One problem with the theory of distance-regular graphs is that it does not apply directly to the gra...
AbstractIn this paper, we are interested in some metric properties of graphs. In particular, we inve...
AbstractA simple connected graph G is said to be interval distance monotone if the interval I(u,v) b...
AbstractWe give a characterization of connected subgraphs G of hypercubes H such that the distance i...
AbstractWe give the construction of an infinite family of interval-regular graphs which are not inte...
Interval I(u,v) je zaprt, če za vsako vozlišče w iz množice V(G)I(u,v) obstaja tako vozlišče w\u27 v...
AbstractWe give two new characterizations of the Hamming graph, which is a natural generalization of...
A distance graph G(X;D) is a graph whose set of vertices is the set of points X of a metric space (X...
For a collection of graphs G, the distance graph of G is defined to be the graph containing a vertex...
This thesis begins with a selective overview of problems in geometric graph theory, a rapidly evolvi...
AbstractChatrand et al. [Graph similarity and distance in graphs, Aequationes Math. 55 (1998) 129–14...
Abstract. The concept of distance is one of the basic concepts in Mathematics. How far two objects (...
Modern quantitative challenges require to tackle problems on increasingly complex systems in which t...
AbstractWe classify distance-regular graphs that are isometrically embeddable into halved cube graph...
AbstractA generalized hypercube Qd(S) (S ⊆ {1, 2, …, d}) has {0,1}d as vertex set and two vertices a...
One problem with the theory of distance-regular graphs is that it does not apply directly to the gra...
AbstractIn this paper, we are interested in some metric properties of graphs. In particular, we inve...
AbstractA simple connected graph G is said to be interval distance monotone if the interval I(u,v) b...
AbstractWe give a characterization of connected subgraphs G of hypercubes H such that the distance i...
AbstractWe give the construction of an infinite family of interval-regular graphs which are not inte...
Interval I(u,v) je zaprt, če za vsako vozlišče w iz množice V(G)I(u,v) obstaja tako vozlišče w\u27 v...
AbstractWe give two new characterizations of the Hamming graph, which is a natural generalization of...
A distance graph G(X;D) is a graph whose set of vertices is the set of points X of a metric space (X...
For a collection of graphs G, the distance graph of G is defined to be the graph containing a vertex...
This thesis begins with a selective overview of problems in geometric graph theory, a rapidly evolvi...
AbstractChatrand et al. [Graph similarity and distance in graphs, Aequationes Math. 55 (1998) 129–14...
Abstract. The concept of distance is one of the basic concepts in Mathematics. How far two objects (...
Modern quantitative challenges require to tackle problems on increasingly complex systems in which t...
AbstractWe classify distance-regular graphs that are isometrically embeddable into halved cube graph...
AbstractA generalized hypercube Qd(S) (S ⊆ {1, 2, …, d}) has {0,1}d as vertex set and two vertices a...
One problem with the theory of distance-regular graphs is that it does not apply directly to the gra...