A characterization of -closed graphs
Pavol Híc (1989)
Mathematica Slovaca
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Random threshold graphs.”
A characterization of -closed graphs
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.
On the Extension of Graphs with a Given Diameter without Superfluous Edges
Ferdinand Gliviak, Peter Kyš, Ján Plesník (1969)
Matematický časopis
Similarity:
Homomorphisms of infinite bipartite graphs onto complete bipartite graphs
Bohdan Zelinka (1983)
Czechoslovak Mathematical Journal
Similarity: