characterizing symmetric diametrical graphs of order and diameter描述对称直径的图表的顺序和直径.pdfVIP

IJMMS 30:3 (2002) 145–149 PII. S0161171202012474 © Hindawi Publishing Corp. CHARACTERIZING SYMMETRIC DIAMETRICAL GRAPHS OF ORDER 12 AND DIAMETER 4 S. AL-ADDASI and H. Al-EZEH Received 21 March 2001 and in revised form 29 August 2001 ¯ A diametrical graph G is said to be symmetric if d(u,v) + d(v, u) = d(G) for all u,v ∈ ¯ V (G), where u is the buddy of u. If moreover, G is bipartite, then it is called an S -graph. It would be shown that the Cartesian product K2 × C6 is not only the unique S -graph of order 12 and diameter 4, but also the unique symmetric diametrical graph of order 12 and diameter 4. 2000 Mathematics Subject Classification: 05C75. 1. Introduction. Diametrical graphs are an interesting class of graphs. They have been investigated by quite many authors under different names. Some of them studied the properties of these graphs, see Mulder [5, 6], Parthasarathy and Nandakumar [7], and Göbel and Veldman [3]. Certain special classes of diametrical graphs have been classified and studied by others, see Göbel and Veldman [3] and Berman and Kotzig [2]. In that direction, Al-Addasi [ 1] has studied some properties of bipartite diametri- cal graphs of diameter 4 and constructed an S -graph of diameter 4 and order 4k for any k ≥ 2. (Recall that the Cartesian product G1 × G2 of two graphs G1 and G2 is the graph whose vertex set consists of all ordered pairs (x1,x2 ) where x1 is a vertex of G and x is a vertex of G such that two vertices (x ,x ) and (y ,y ) are adjacent 1 2 2 1 2 1 2 exactly when either x = y and x y is an edge of G , or x y is an edge of G an