Displaying similar documents to “Decomposition of bipartite graphs into closed trails”

Decomposition of complete graphs into ( 0 , 2 ) -prisms

Sylwia Cichacz, Soleh Dib, Dalibor Fronček (2014)

Czechoslovak Mathematical Journal

Similarity:

R. Frucht and J. Gallian (1988) proved that bipartite prisms of order 2 n have an α -labeling, thus they decompose the complete graph K 6 n x + 1 for any positive integer x . We use a technique called the ρ + -labeling introduced by S. I. El-Zanati, C. Vanden Eynden, and N. Punnim (2001) to show that also some other families of 3-regular bipartite graphs of order 2 n called generalized prisms decompose the complete graph K 6 n x + 1 for any positive integer x .

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

Two classes of graphs related to extremal eccentricities

Ferdinand Gliviak (1997)

Mathematica Bohemica

Similarity:

A graph G is called an S -graph if its periphery P e r i ( G ) is equal to its center eccentric vertices C e p ( G ) . Further, a graph G is called a D -graph if P e r i ( G ) C e p ( G ) = . We describe S -graphs and D -graphs for small radius. Then, for a given graph H and natural numbers r 2 , n 2 , we construct an S -graph of radius r having n central vertices and containing H as an induced subgraph. We prove an analogous existence theorem for D -graphs, too. At the end, we give some properties of S -graphs and D -graphs.