โ Scribed by K. M. Koh; K. S. Poh
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Denote by e\*(L) and ~,(L) respectively the upper length and lower length of a finite lattice L. The lattice L is said to be uniform if for each integer k with e,(L) < k < ยข\*(L) there exists in L a maximal chain of length k. It is shown that the closed-set lattice of a finite graph G is uniform if
Let L(T) be the closed-set latice of a tree T. The lower length l, (L(T)) of L (T) is defined as Call a set S of vertices in T a sparse set if d(x, y)/> 3 for any two distinct vertices x, y in S. The sparsity y(T) of T is defined as y(T) = max {Isl: s is a sparse set of T}. We prove that, for any
In this paper an isomorphism testing algorithm for graphs in the family of all cubic metacirculant graphs with non-empty first symbol So is given. The time complexity of this algorithm is also evaluated.
For a subset S of a group G such that 1 / โ S and S = S -1 , the associated Cayley graph Cay(G, S) is the graph with vertex set G such that {x, y} is an edge if and only if yx -1 โ S. Each ฯ โ Aut(G) induces an isomorphism from Cay(G, S) to the Cayley graph Cay(G, S ฯ ). For a positive integer m, th