On tree-complete graphs
Ladislav Nebeský (1975)
Časopis pro pěstování matematiky
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On the Relationships between Zero Forcing Numbers and Certain Graph Coverings”
On tree-complete graphs
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.
A generalization of Hamiltonian cycles for trees
Ladislav Nebeský (1976)
Czechoslovak Mathematical Journal
Similarity:
On Graphs with Disjoint Dominating and 2-Dominating Sets
Michael A. Henning, Douglas F. Rall (2013)
Discussiones Mathematicae Graph Theory
Similarity:
A DD2-pair of a graph G is a pair (D,D2) of disjoint sets of vertices of G such that D is a dominating set and D2 is a 2-dominating set of G. Although there are infinitely many graphs that do not contain a DD2-pair, we show that every graph with minimum degree at least two has a DD2-pair. We provide a constructive characterization of trees that have a DD2-pair and show that K3,3 is the only connected graph with minimum degree at least three for which D ∪ D2 necessarily contains all vertices...