Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

On degree sets and the minimum orders in bipartite graphs

100%

Manoussakis Y., Patil H. P.

Discussiones Mathematicae Graph Theory

2014

tom 34

nr 2

383-390

For any simple graph G, let D(G) denote the degree set {degG(v) : v ∈ V (G)}. Let S be a finite, nonempty set of positive integers. In this paper, we first determine the families of graphs G which are unicyclic, bipartite satisfying D(G) = S, and further obtain the graphs of minimum orders in such families. More general, for a given pair (S, T) of finite, nonempty sets of positive integers of the same cardinality, it is shown that there exists a bipartite graph B(X, Y ) such that D(X) = S, D(Y ) = T and the minimum orders of different types are obtained for such graphs

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

Directed and antidirected Hamiltonian cycles and paths in bipartite graphs

81%

Chakroun N., Manoussakis M., Manoussakis Y.

Banach Center Publications

1989

tom 25

nr 1

39-46

Ograniczanie wyników

1 Banach Center Publications

1 Discussiones Mathematicae Graph Theory

2 Manoussakis Y.

1 Chakroun N.

1 Manoussakis M.

1 Patil H. P.

1 2014

1 1989

Wyniki wyszukiwania

On degree sets and the minimum orders in bipartite graphs

Directed and antidirected Hamiltonian cycles and paths in bipartite graphs