You are here

Home » Content

KENDİNİ MERKEZLEYEN ÇİZGELERİN UZAKLIK ÖLÇÜMLERİ VE ORTASI

THE MEDIAN AND DISTANCE MEASURES OF SELF-CENTRED GRAPHS

Journal Name:

  • Sigma Mühendislik ve Fen Bilimleri Dergisi

Publication Year:

  • 2004

Key Words:

Keywords (Original Language):

Author NameUniversity of Author
Abstract (2. Language): 
The median of a graph is the set of vertices which has the minimum distance. The set defines the Median sub graph. In this paper, firstly we search the median of a self-centred graph. After we define the new graph operation that is called thick product. We prove some theorems on the median of the products of two selfcentred graphs. Specially, we give the some results on the median of hypercube, because of hypercube is an important computer network topology and it is a self-centred graph.
Bookmark/Search this post with
Abstract (Original Language): 
Bir çizgenin ortası,minimum uzaklıklı düğümlerinin kümesidir.Bu düğümlerin kümesi çizgenin orta çizgesini tanımlar.Bu çalışmada önce kendini merkezleyen çizgelerin ortası çalışılmıştır.Yeni bir çizge işlemi olarak yoğun çarpım tanımlanmıştır.Sonra, iki kendini merkezleyen çizgenin çarpım çizgelerinin ortası üzerine teoremler ispatlanmıştır.Özel olarak da kendini merkezleyen çizgeler sınıfından ve önemli bir ağ topologisi olan hiperküb çizgelerin ortası üzerine sonuçlar verilmiştir.
FULL TEXT (PDF): 
PDF icon arastrmx_845_22_pp_229-233.pdf
  • 4
229-233
  • Turkish

REFERENCES

References: 

[1] P.Dankelmann-W.Goddard-M.Henning-H.Swart, Generalized Eccentricity, Radius and
Diameter in Graphs, Networks, vol.34, pp.312-319,( 1999).
[2] C.Smart-P.J.Slater, Centre, Median and Centroid Sub graphs, Networks, vol.34, pp.303-
311, (1999).
[3] F.Buckley-F.Harary, Distance in Graphs, Addison-Wesley Pub.California, (1990).
[4] L.Lesniak,. and G. Chartrand, Graphs and Digraphs, California, Wadsworth & Brooks,
(1986).
[5] M.N. Allahverdi - Ş.Ş Kahramanli - K.A Erciyes , Fault Tolerant Routing Algorithm
Based on Cube Algebra For Hypercube,J.of Systems Architecture,vol.46,pp.201-205,
(2000).
[6] P.Dündar, - E.Kilic, A Fault Tolerant Routing Algorithm on Neighbour-Faulty
Hypercube, EURO 2003, EURO/INFORMS Conference in Istanbul, (2003).
[7] P.Dündar, Neighbour-integrity of Boolean Graphs and Its Compounds, Int. J. of
Computer. Math., Vol.72, pp.441-447(1999).
[8] P.Dündar, The Realization of Boolean Function with Minimum Contact by Qn
Graph”,
J .of Faculty of Science Ege Üniv.Seri a Vol.12-2, 61-67, (1989).
[9] O.Freider-F.Harary-P.J.Wan, A Radio Colouring of a Hypercube, Inter.J.Computer
Math.Vol.79-6, pp.665-670,(2002).
[10] V. Kumar, - A. Grama – A Gupta, G. Karpis, Introduction To Parallel Computing, The
Benjamin Cummings Pub. California, (1994).

Thank you for copying data from http://www.arastirmax.com