Modal Expressiveness of Graph Properties

Graphs are among the most frequently used structures in Computer Science. In this work, we analyze how we can express some important graph properties such as connectivity, acyclicity and the Eulerian and Hamiltonian properties in a modal logic. First, we show that these graph properties are not definable in a basic modal language. Second, we discuss an extension of the basic modal language with fix-point operators, the modal

• Type: Journal
• Year: 2008
• Where: ENTCS
• Authors: Mario R. F. Benevides, L. Menasché Schechter
• Keywords: Basic Modal Language, ENTCS 2008, Graph Properties, Important Graph Properties