A remark on the Čebyšev property
Bohdan Zelinka (1978)
Mathematica Slovaca
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Bohdan Zelinka (1978)
Mathematica Slovaca
Similarity:
Surahmat, Baskoro, E.T., Broersma, H.J. (2004)
Integers
Similarity:
Bohdan Zelinka (2004)
Mathematica Bohemica
Similarity:
A caterpillar is a tree with the property that after deleting all its vertices of degree 1 a simple path is obtained. The signed 2-domination number and the signed total 2-domination number of a graph are variants of the signed domination number and the signed total domination number . Their values for caterpillars are studied.
Boza, Luis (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Richard Brewster, Christina Mynhardt, Laura Teshima (2013)
Open Mathematics
Similarity:
A dominating broadcast on a graph G = (V, E) is a function f: V → {0, 1, ..., diam G} such that f(v) ≤ e(v) (the eccentricity of v) for all v ∈ V and such that each vertex is within distance f(v) from a vertex v with f(v) > 0. The cost of a broadcast f is σ(f) = Σv∈V f(v), and the broadcast number λ b (G) is the minimum cost of a dominating broadcast. A set X ⊆ V(G) is said to be irredundant if each x ∈ X dominates a vertex y that is not dominated by any other vertex in X; possibly...