Displaying similar documents to “Circular distance in directed graphs”

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.

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.

Linear integral equations in the space of regulated functions

Milan Tvrdý (1998)

Mathematica Bohemica

Similarity:

n this paper we investigate systems of linear integral equations in the space 𝔾 L n of n -vector valued functions which are regulated on the closed interval [ 0 , 1 ] (i.e. such that can have only discontinuities of the first kind in [ 0 , 1 ] ) and left-continuous in the corresponding open interval ( 0 , 1 ) . In particular, we are interested in systems of the form x(t) - A(t)x(0) - 01B(t,s)[d x(s)] = f(t), where f ∈ 𝔾 L n , the columns of the n × n -matrix valued function A belong to 𝔾 L n , the entries of B ( t , . ) have a bounded variation...