Minimal size of a graph with diameter 2 and given maximal degree. II.
Znám, Š. (1992)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Znám, Š. (1992)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Bohdan Zelinka (1983)
Mathematica Slovaca
Similarity:
Hopkins, Glenn, Staton, William (1989)
International Journal of Mathematics and Mathematical Sciences
Similarity:
M.S.A. Bataineh, M.M.M. Jaradat, M.S. Bateeha (2014)
Discussiones Mathematicae Graph Theory
Similarity:
For any two graphs F1 and F2, the graph Ramsey number r(F1, F2) is the smallest positive integer N with the property that every graph on at least N vertices contains F1 or its complement contains F2 as a subgraph. In this paper, we consider the Ramsey numbers for theta-complete graphs. We determine r(θn,Km) for m = 2, 3, 4 and n > m. More specifically, we establish that r(θn,Km) = (n − 1)(m − 1) + 1 for m = 3, 4 and n > m
Ali Ahmad, E.T. Baskoro, M. Imran (2012)
Discussiones Mathematicae Graph Theory
Similarity:
A total vertex irregular k-labeling φ of a graph G is a labeling of the vertices and edges of G with labels from the set {1,2,...,k} in such a way that for any two different vertices x and y their weights wt(x) and wt(y) are distinct. Here, the weight of a vertex x in G is the sum of the label of x and the labels of all edges incident with the vertex x. The minimum k for which the graph G has a vertex irregular total k-labeling is called the total vertex irregularity strength of G. We...
Bohdan Zelinka (1989)
Mathematica Slovaca
Similarity:
Halina Bielak (1988)
Časopis pro pěstování matematiky
Similarity: