A note on the k-domination number of a graph.
Caro, Y., Roditty, Y. (1990)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Displaying similar documents to “On certain regular graphs of girth 5.”
A note on the k-domination number of a graph.
Tight upper bounds for the domination numbers of graphs with given order and minimum degree.
Clark, W.Edwin, Dunning, Larry A. (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A bound for size Ramsey numbers of multipartite graphs.
Sun, Yuqin, Li, Yusheng (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
-free graphs of large minimum degree.
Alon, Noga, Sudakov, Benny (2006)
The Electronic Journal of Combinatorics [electronic only]
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.
Tiling tripartite graphs with 3-colorable graphs.
Martin, Ryan, Zhao, Yi (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On some regularities of graphs. I.
Jerzy Płonka (1982)
Časopis pro pěstování matematiky
Similarity:
Reconstruction of graphs with certain degree-sequences.
Stacho, L. (1992)
Acta Mathematica Universitatis Comenianae. New Series
Similarity: