On graphs with isomorphic, non-isomorphic and connected -neighbourhoods
Zdeněk Ryjáček (1987)
Časopis pro pěstování matematiky
Similarity:
Zdeněk Ryjáček (1987)
Časopis pro pěstování matematiky
Similarity:
Bohdan Zelinka (1986)
Mathematica Slovaca
Similarity:
Vojtech Bálint, Ondrej Vacek (2004)
Mathematica Bohemica
Similarity:
The eccentricity of a vertex is defined as the distance to a farthest vertex from . The radius of a graph is defined as a . A graph is radius-edge-invariant if for every , radius-vertex-invariant if for every and radius-adding-invariant if for every . Such classes of graphs are studied in this paper.
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