论文信息 - Clique-gated graphs

Clique-gated graphs

Abstract Clique-gated graphs form an extension of quasi-median graphs. Two characterizations of these graphs are given and some other structural properties are obtained. An O( nm ) algorithm is presented which recognizes clique-gated graphs. Here n and m denote the numbers of vertices and edges of a given graph, respectively.

Sandi Klavzar | Johann Hagauer | S. Klavžar | Johann Hagauer

[1] Michael E. Saks,et al. A Dynamic location problem for graphs , 1989, Comb..

[2] Hans-Jürgen Bandelt,et al. Quasi-median graphs and algebras , 1994, J. Graph Theory.

[3] S. P. Avann. Metric ternary distributive semi-lattices , 1961 .

[4] Martyn Mulder,et al. The structure of median graphs , 1978, Discret. Math..

[5] H. M. Mulder. The interval function of a graph , 1980 .

[6] Johann Hagauer,et al. Skeletons, recognition algorithm and distance matrix of quasi-median graphs , 1995, Int. J. Comput. Math..

[7] W. Ilfried,et al. On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs , 1996 .

[8] Elke Wilkeit,et al. The retracts of Hamming graphs , 1992, Discret. Math..

[9] Dwight Duffus,et al. Graphs orientable as distributive lattices , 1983 .

[10] Andreas W. M. Dress,et al. Gated sets in metric spaces , 1987 .

[11] Hans-Jürgen Bandelt,et al. Retracts of hypercubes , 1984, J. Graph Theory.

[12] Elke Wilkeit,et al. Isometric embeddings in Hamming graphs , 1990, J. Comb. Theory, Ser. B.

[13] Michael E. Saks,et al. Dynamic Search in Graphs , 1987 .

[14] Alexander Schrijver,et al. Median graphs and Helly hypergraphs , 1979, Discret. Math..

[15] Henry Martyn Mulder. N-cubes and Median Graphs , 1980, J. Graph Theory.

[16] Hans-J. Bandelt,et al. Infinite median graphs, (0, 2)-graphs, and hypercubes , 1983, J. Graph Theory.