In this note we show that the edge-connectivity λ (G× H) of the direct product of graphs G and
H is bounded below by min {λ (G)| E (H)|, λ (H)| E (G)|, δ (G× H)} and above by min {2λ (G)| E …

Paley graphs are Cayley graphs which are circulant and strongly regular. Paley-type graph
of order a product of two distinct Pythagorean primes was introduced by Dr Angsuman Das …

If we are given a connected finite graph $ G $ and a subset of its vertices $ V_ {0} $, we
define a distance-residual graph as a graph induced on the set of vertices that have the …

It is well-known that the different products of graphs are some of the more symmetric classes
of graphs. Since we are interested in hyperbolicity, it is interesting to study this property in …

A simple connected graph G is said to be a self-centered graph if every vertex has the same
eccentricity. Tensor product of self-centered graphs may not be a self-centered graph. In this …

If we are given a connected finite graph G and a subset of its vertices V0, we define a
distance-residual graph as a graph induced on the set of vertices that have the maximal …

For a connected finite graph G and a subset V0 of its vertex set, a distance-residual
subgraph is a subgraph induced on the set of vertices at the maximal distance from V0 …

Sea X un espacio métrico geodésico y x1, x2, x3∈ X. Un triángulo geodésico T={x1, x2, x3}
es la unión de tres geodésicas [x1x2],[x2x3] y [x3x1] de X. El espacio X es δ-hiperbólico (en …

The thesis explores the concept of growth in graphs and some similar concepts, such as the
distance of a vertex or a graph, distance-balanced graphs, distance-residual subgraphs and …