Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

The hyperbolicity constant of infinite circulant graphs

José M. RodríguezJosé M. Sigarreta — 2017

Open Mathematics

If X is a geodesic metric space and x1, x2, x3 ∈ X, a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X. The space X is δ-hyperbolic (in the Gromov sense) if any side of T is contained in a δ-neighborhood of the union of the two other sides, for every geodesic triangle T in X. Deciding whether or not a graph is hyperbolic is usually very difficult; therefore, it is interesting to find classes of graphs which are hyperbolic. A graph is circulant...

On the Totalk-Domination in Graphs

Sergio BermudoJuan C. Hernández-GómezJosé M. Sigarreta — 2018

Discussiones Mathematicae Graph Theory

Let G = (V, E) be a graph; a set S ⊆ V is a total k-dominating set if every vertex v ∈ V has at least k neighbors in S. The total k-domination number γkt(G) is the minimum cardinality among all total k-dominating sets. In this paper we obtain several tight bounds for the total k-domination number of a graph. In particular, we investigate the relationship between the total k-domination number of a graph and the order, the size, the girth, the minimum and maximum degree, the diameter, and other domination...

Page 1

Download Results (CSV)