Embedding trees into clique-bridge-clique graphs
Bohdan Zelinka (1979)
Časopis pro pěstování matematiky
Similarity:
Bohdan Zelinka (1979)
Časopis pro pěstování matematiky
Similarity:
Bohdan Zelinka (1985)
Časopis pro pěstování matematiky
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.
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson (2013)
Discussiones Mathematicae Graph Theory
Similarity:
For a fixed graph F, a graph G is F-saturated if there is no copy of F in G, but for any edge e ∉ G, there is a copy of F in G + e. The minimum number of edges in an F-saturated graph of order n will be denoted by sat(n, F). A graph G is weakly F-saturated if there is an ordering of the missing edges of G so that if they are added one at a time, each edge added creates a new copy of F. The minimum size of a weakly F-saturated graph G of order n will be denoted by wsat(n, F). The graphs...
Bohdan Zelinka (1992)
Archivum Mathematicum
Similarity:
Edge shift distance between isomorphism classes of graphs, introduced by M. Johnson, is investigated in the case of trees and compared with other distances.