Graphs with many copies of a given subgraph.
Nikiforov, Vladimir (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Nikiforov, Vladimir (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sudakov, Benny (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Knopfmacher, A., Mays, M.E. (2001)
Integers
Similarity:
Clark, Lane (2002)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Henning, Michael A., Yeo, Anders (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Matousek, Jirí, Sámal, Robert (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Calkin, N., Merino, C., Noble, S., Noy, M. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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.
Martin Bača, James A. MacDougall, François Bertault, Mirka Miller, Rinovia Simanjuntak, Slamin (2003)
Discussiones Mathematicae Graph Theory
Similarity:
In this paper we introduce a new type of graph labeling for a graph G(V,E) called an (a,d)-vertex-antimagic total labeling. In this labeling we assign to the vertices and edges the consecutive integers from 1 to |V|+|E| and calculate the sum of labels at each vertex, i.e., the vertex label added to the labels on its incident edges. These sums form an arithmetical progression with initial term a and common difference d. We investigate basic properties of these labelings,...
Fujita, Shinya, Magnant, Colton (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity: