On distances in some bipartite graphs.

Gutman, Ivan

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

The search session has expired. Please query the service again.

Displaying similar documents to “On distances in some bipartite graphs.”

Disconnected neighbourhood graphs

Bohdan Zelinka (1986)

Mathematica Slovaca

Similarity:

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.