Displaying similar documents to “On Cyclic Decompositions of the Complete Graph into ( 4 m + 2 )-Gons”

Magic powers of graphs

Marián Trenkler, Vladimír Vetchý (1997)

Mathematica Bohemica

Similarity:

Necessary and sufficient conditions for a graph G that its power G i , i ≥ 2 , is a magic graph and one consequence are given.

Circular distance in directed graphs

Bohdan Zelinka (1997)

Mathematica Bohemica

Similarity:

Circular distance d ∘ ( x , y ) between two vertices x , y of a strongly connected directed graph G is the sum d ( x , y ) + d ( y , x ) , where d is the usual distance in digraphs. Its basic properties are studied.

Dominating functions of graphs with two values

Bohdan Zelinka (1998)

Mathematica Bohemica

Similarity:

The Y -domination number of a graph for a given number set Y was introduced by D. W. Bange, A. E. Barkauskas, L. H. Host and P. J. Slater as a generalization of the domination number of a graph. It is defined using the concept of a Y -dominating function. In this paper the particular case where Y = { 0 , 1 / k } for a positive integer k is studied.