Displaying similar documents to “Magic powers of graphs”

Comparison theorems for differential equations of neutral type

Miroslava Růžičková (1997)

Mathematica Bohemica

Similarity:

We are interested in comparing the oscillatory and asymptotic properties of the equations L n [ x ( t ) - P ( t ) x ( g ( t ) ) ] + δ f ( t , x ( h ( t ) ) ) = 0 with those of the equations M n [ x ( t ) - P ( t ) x ( g ( t ) ) ] + δ Q ( t ) q ( x ( r ( t ) ) ) = 0 .

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.

Spectral properties of fourth order differential operators

Ondřej Došlý, Roman Hilscher (1997)

Mathematica Bohemica

Similarity:

Necessary and sufficient conditions for discreteness and boundedness below of the spectrum of the singular differential operator ( y ) 1 w ( t ) ( r ( t ) y ) , t [ a , ) are established. These conditions are based on a recently proved relationship between spectral properties of and oscillation of a certain associated second order differential equation.