The number of isomorphism classes of spanning trees of a graph
Bohdan Zelinka (1978)
Mathematica Slovaca
Similarity:
Bohdan Zelinka (1978)
Mathematica Slovaca
Similarity:
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.
Dariusz Dereniowski (2009)
Discussiones Mathematicae Graph Theory
Similarity:
A vertex k-ranking of a simple graph is a coloring of its vertices with k colors in such a way that each path connecting two vertices of the same color contains a vertex with a bigger color. Consider the minimum vertex ranking spanning tree (MVRST) problem where the goal is to find a spanning tree of a given graph G which has a vertex ranking using the minimal number of colors over vertex rankings of all spanning trees of G. K. Miyata et al. proved in [NP-hardness proof and an approximation...
Bohdan Zelinka (1980)
Mathematica Slovaca
Similarity:
Hegde, Suresh Manjanath, Shetty, Sudhakar (2002)
Applied Mathematics E-Notes [electronic only]
Similarity:
Dean, Alice M., Hutchinson, Joan P. (1998)
Journal of Graph Algorithms and Applications
Similarity:
Ladislav Nebeský (1975)
Časopis pro pěstování matematiky
Similarity:
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...