Displaying similar documents to “Dominating functions of graphs with two values”

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.

Point-set domatic numbers of graphs

Bohdan Zelinka (1999)

Mathematica Bohemica

Similarity:

A subset D of the vertex set V ( G ) of a graph G is called point-set dominating, if for each subset S V ( G ) - D there exists a vertex v D such that the subgraph of G induced by S { v } is connected. The maximum number of classes of a partition of V ( G ) , all of whose classes are point-set dominating sets, is the point-set domatic number d p ( G ) of G . Its basic properties are studied in the paper.

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...

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.