Self-complementary vertex-transitive undirected graphs
Bohdan Zelinka (1979)
Mathematica Slovaca
Similarity:
Displaying similar documents to “On non-z(mod k) dominating sets”
Self-complementary vertex-transitive undirected 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.
Heights in finite projective space, and a problem on directed graphs.
Nathanson, Melvyn B., Sullivan, Blair D. (2008)
Integers
Similarity:
On the minimum number of vertices and edges in a graph with a given number of spanning trees
Ladislav Nebeský (1973)
Časopis pro pěstování matematiky
Similarity:
On distances in some bipartite graphs.
Gutman, Ivan (1988)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity: