Disconnected neighbourhood graphs
Bohdan Zelinka (1986)
Mathematica Slovaca
Similarity:
Displaying similar documents to “On distances in some bipartite graphs.”
Disconnected neighbourhood graphs
On magic and supermagic line graphs
Jaroslav Ivančo, Z. Lastivková, A. Semaničová (2004)
Mathematica Bohemica
Similarity:
A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (consecutive) positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. We characterize magic line graphs of general graphs and describe some class of supermagic line graphs of bipartite graphs.
On a quasiordering of bipartite graphs.
Gutman, Ivan, Fuji, Zhang (1986)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Graphs in which each pair of vertices has exactly two common neighbours
Bohdan Zelinka (1993)
Mathematica Bohemica
Similarity:
The paper studies graphs in which each pair of vertices has exactly two common neighbours. It disproves a conjectury by P. Hliněný concerning these graphs.
The distance between a graph and its complement
Bohdan Zelinka (1987)
Czechoslovak Mathematical Journal
Similarity: