Displaying similar documents to “Interpolation theorem for a continuous function on orientations of a simple graph”

Interpolation theorems for a family of spanning subgraphs

San Ming Zhou (1998)

Czechoslovak Mathematical Journal

Similarity:

Let G be a graph with order p , size q and component number ω . For each i between p - ω and q , let 𝒞 i ( G ) be the family of spanning i -edge subgraphs of G with exactly ω components. For an integer-valued graphical invariant ϕ , if H H ' is an adjacent edge transformation (AET) implies | ϕ ( H ) - ϕ ( H ' ) | 1 , then ϕ is said to be continuous with respect to AET. Similarly define the continuity of ϕ with respect to simple edge transformation (SET). Let M j ( ϕ ) and m j ( ϕ ) be the invariants defined by M j ( ϕ ) ( H ) = max T 𝒞 j ( H ) ϕ ( T ) , m j ( ϕ ) ( H ) = min T 𝒞 j ( H ) ϕ ( T ) . It is proved that both M p - ω ( ϕ ) and...

On the order of certain close to regular graphs without a matching of given size

Sabine Klinkenberg, Lutz Volkmann (2007)

Czechoslovak Mathematical Journal

Similarity:

A graph G is a { d , d + k } -graph, if one vertex has degree d + k and the remaining vertices of G have degree d . In the special case of k = 0 , the graph G is d -regular. Let k , p 0 and d , n 1 be integers such that n and p are of the same parity. If G is a connected { d , d + k } -graph of order n without a matching M of size 2 | M | = n - p , then we show in this paper the following: If d = 2 , then k 2 ( p + 2 ) and (i) n k + p + 6 . If d 3 is odd and t an integer with 1 t p + 2 , then (ii) n d + k + 1 for k d ( p + 2 ) , (iii) n d ( p + 3 ) + 2 t + 1 for d ( p + 2 - t ) + t k d ( p + 3 - t ) + t - 3 , (iv) n d ( p + 3 ) + 2 p + 7 for k p . If d 4 is even, then (v) n d + k + 2 - η for k d ( p + 3 ) + p + 4 + η , (vi) n d + k + p + 2 - 2 t = d ( p + 4 ) + p + 6 for k = d ( p + 3 ) + 4 + 2 t and p 1 ,...

Graceful signed graphs

Mukti Acharya, Tarkeshwar Singh (2004)

Czechoslovak Mathematical Journal

Similarity:

A ( p , q ) -sigraph S is an ordered pair ( G , s ) where G = ( V , E ) is a ( p , q ) -graph and s is a function which assigns to each edge of G a positive or a negative sign. Let the sets E + and E - consist of m positive and n negative edges of G , respectively, where m + n = q . Given positive integers k and d , S is said to be ( k , d ) -graceful if the vertices of G can be labeled with distinct integers from the set { 0 , 1 , , k + ( q - 1 ) d } such that when each edge u v of G is assigned the product of its sign and the absolute difference of the integers assigned to...