Global defensive alliances in graphs.
Haynes, Teresa W., Hedetniemi, Stephen T., Henning, Michael A. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Proof of the conjecture for large .”
Global defensive alliances in graphs.
Downhill Domination in Graphs
Teresa W. Haynes, Stephen T. Hedetniemi, Jessie D. Jamieson, William B. Jamieson (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A path π = (v1, v2, . . . , vk+1) in a graph G = (V,E) is a downhill path if for every i, 1 ≤ i ≤ k, deg(vi) ≥ deg(vi+1), where deg(vi) denotes the degree of vertex vi ∈ V. The downhill domination number equals the minimum cardinality of a set S ⊆ V having the property that every vertex v ∈ V lies on a downhill path originating from some vertex in S. We investigate downhill domination numbers of graphs and give upper bounds. In particular, we show that the downhill domination number...
Embedding a forest in a graph.
Goldberg, Mark K., Magdon-Ismail, Malik (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars.
Piguet, Diana, Stein, Maya Jakobine (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Saturation numbers for trees.
Faudree, Jill, Faudree, Ralph J., Gould, Ronald J., Jacobson, Michael S. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Relaxed graceful labellings of trees.
Van Bussel, Frank (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On -factors in the cube of a graph
Ladislav Nebeský (1981)
Časopis pro pěstování matematiky
Similarity:
Extended trees of graphs
Bohdan Zelinka (1994)
Mathematica Bohemica
Similarity:
An extended tree of a graph is a certain analogue of spanning tree. It is defined by means of vertex splitting. The properties of these trees are studied, mainly for complete graphs.