On graphs with given neighbourhoods
Peter Bugata, Mirko Horňák, Stanislav Jendroľ (1989)
Časopis pro pěstování matematiky
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On degree sets and the minimum orders in bipartite graphs”
On graphs with given neighbourhoods
Bipartite diametrical graphs of diameter 4 and extreme orders.
Al-Addasi, Salah, Al-Ezeh, Hasan (2008)
International Journal of Mathematics and Mathematical Sciences
Similarity:
On the existence of 1-factors in partial squares of graphs
Ladislav Nebeský (1979)
Czechoslovak Mathematical Journal
Similarity:
On a problem of linear arboricity
Filip Guldan (1987)
Časopis pro pěstování matematiky
Similarity:
Supermagic Graphs Having a Saturated Vertex
Jaroslav Ivančo, Tatiana Polláková (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A graph is called supermagic if it admits a labeling of the edges by pairwise different consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we establish some conditions for graphs with a saturated vertex to be supermagic. Inter alia we show that complete multipartite graphs K1,n,n and K1,2,...,2 are supermagic.