Algebraic approach to fasciagraphs and rotagraphs

Citations of this article
Mendeley users who have this article in their library.


An algebraic approach is proposed which can be used to solve different problems on fasciagraphs and rotagraphs. A particular instance of this method computes the domination number of fasciagraphs and rotagraphs in O(log n) time, where n is the number of monographs of such a graph. Fasciagraphs and rotagraphs include complete grid graphs Pk□Pn and graphs Ck□Cn. The best previously known algorithms for computing the domination number of Pk□Pn are of time complexity O(n) (for a fixed k).




Klavžar, S., & Žerovnik, J. (1996). Algebraic approach to fasciagraphs and rotagraphs. Discrete Applied Mathematics, 68(1–2), 93–100.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free