Learn More
An algebraic approach is proposed which can be used to solve different problems on fasci-agraphs and rotagraphs. A particular instance of this method computes the domination number of fasciagraphs and rotagraphs in O(logn) time, where n is the number of monographs of such a graph. Fasciagraphs and rotagraphs include complete grid graphs Pk 0 P, and graphs(More)