Problem on Datalog for defining properties

The focus is on  the use of Datalog for defining properties  and queries on graphs.

(a) Assume that P is some property of graphs  definable in the Datalog. Show that P is preserved beneath extensions  and homomorphisms. That is, when G is a graph satisfying P, then for every supergraph of G (i.e., graph  extending G) satisfies  P, and  when h is a graph homomorphism, then h(G) satisfies P. Which of the below properties  and queries on graphs are definable in the Datalog?

(b) The number  of vertices  are even.

(c) There is a simple path (that is, a path without repeated vertices) of even length among two specified vertices.

(d) The binary relation? Having all pairs of vertices (a, b) for which  there  is a path of even length from a to b.

Given either a Datalog program stating the property or query or an argument why the property or query is not definable in the Datalog.

#### Related Questions in Mathematics

• ##### Q :Where would we be without stochastic

Where would we be without stochastic or Ito^ calculus?

• ##### Q :Calculus I need it within 4 hours. Due

I need it within 4 hours. Due time March 15, 2014. 3PM Pacific Time. (Los Angeles, CA)

• ##### Q :Who firstly discovered mathematical

Who firstly discovered mathematical theory for random walks, that rediscovered later by Einstein?

• ##### Q :Breakfast program if the average is

if the average is 0.27 and we have \$500 how much break fastest will we serve by 2 weeks

• ##### Q :Problem on mass balance law Using the

Using the mass balance law approach, write down a set of word equations to model the transport of lead concentration.

A) Draw a compartmental model to represent  the diffusion of lead through the lungs and the bloodstream.

• ##### Q :Nonlinear integer programming problem

Explain Nonlinear integer programming problem with an example ?

• ##### Q :Explain Factorisation by trial division

Factorisation by trial division: The essential idea of factorisation by trial division is straightforward. Let n be a positive integer. We know that n is either prime or has a prime divisor less than or equal to √n. Therefore, if we divide n in

• ##### Q :Maths A cricketer cn throw a ball to a

A cricketer cn throw a ball to a max horizontl distnce of 100m. If he throws d same ball vertically upwards then the max height upto which he can throw is????

• ##### Q :Law of iterated expectations for

Prove the law of iterated expectations for continuous random variables.

2. Prove that the bounds in Chebyshev's theorem cannot be improved upon. I.e., provide a distribution that satisfies the bounds exactly for k ≥1, show that it satisfies the bounds exactly, and draw its PDF. T

• ##### Q :Problem on Nash equilibrium In a

In a project, employee and boss are working altogether. The employee can be sincere or insincere, and the Boss can either reward or penalize. The employee gets no benefit for being sincere but gets utility for being insincere (30), for getting rewarded (10) and for be