Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: radial graph

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

Further results on radial graphs

100%

Kathiresan K., Marimuthu G.

Discussiones Mathematicae Graph Theory

2010

tom 30

nr 1

75-83

In a graph G, the distance d(u,v) between a pair of vertices u and v is the length of a shortest path joining them. The eccentricity e(u) of a vertex u is the distance to a vertex farthest from u. The minimum eccentricity is called the radius of the graph and the maximum eccentricity is called the diameter of the graph. The radial graph R(G) based on G has the vertex set as in G, two vertices u and v are adjacent in R(G) if the distance between them in G is equal to the radius of G. If G is disconnected, then two vertices are adjacent in R(G) if they belong to different components. The main objective of this paper is to characterize graphs G with specified radius for its radial graph.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Kathiresan K.

1 Marimuthu G.

1 2010

Wyniki wyszukiwania

Further results on radial graphs