Displaying similar documents to “Front-divisors of trees.”

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.

On the Relationships between Zero Forcing Numbers and Certain Graph Coverings

Fatemeh Alinaghipour Taklimi, Shaun Fallat, Karen Meagher (2014)

Special Matrices

Similarity:

The zero forcing number and the positive zero forcing number of a graph are two graph parameters that arise from two types of graph colourings. The zero forcing number is an upper bound on the minimum number of induced paths in the graph that cover all the vertices of the graph, while the positive zero forcing number is an upper bound on the minimum number of induced trees in the graph needed to cover all the vertices in the graph. We show that for a block-cycle graph the zero forcing...