Discrete mathematics – mathematicssolution
http://mathematicssolution.com
mathematicssolutionSun, 28 May 2017 03:42:42 +0000en-UShourly1Procedure for computing shortest distance| Discrete Mathematics
http://mathematicssolution.com/procedure-for-computing-shortest-distance-discrete-mathematics/
http://mathematicssolution.com/procedure-for-computing-shortest-distance-discrete-mathematics/#respondSun, 31 Jan 2016 05:13:10 +0000http://mathematicssolution.com/?p=485http://mathematicssolution.com/procedure-for-computing-shortest-distance-discrete-mathematics/feed/0Euler’s formula for planner graphs| Discrete Mathematics
http://mathematicssolution.com/eulers-formula-for-planner-graphs-discrete-mathematics/
http://mathematicssolution.com/eulers-formula-for-planner-graphs-discrete-mathematics/#respondSat, 30 Jan 2016 06:23:21 +0000http://mathematicssolution.com/?p=470http://mathematicssolution.com/eulers-formula-for-planner-graphs-discrete-mathematics/feed/0An undirected graph possess an Eulerian path if and only if, is connected and has either zero or two vertices of odd degree.
http://mathematicssolution.com/an-undirected-graph-possess-an-eulerian-path-if-and-only-if-is-connected-and-has-either-zero-or-two-vertices-of-odd-degree/
http://mathematicssolution.com/an-undirected-graph-possess-an-eulerian-path-if-and-only-if-is-connected-and-has-either-zero-or-two-vertices-of-odd-degree/#respondFri, 29 Jan 2016 19:10:39 +0000http://mathematicssolution.com/?p=467http://mathematicssolution.com/an-undirected-graph-possess-an-eulerian-path-if-and-only-if-is-connected-and-has-either-zero-or-two-vertices-of-odd-degree/feed/0A tree has two vertices of degree 2. One vertex of degree 3 and 3 vertices of degree 4.How many vertices of degree 1 does it have?
http://mathematicssolution.com/a-tree-has-two-vertices-of-degree-2-one-vertex-of-degree-3-and-3-vertices-of-degree-4-how-many-vertices-of-degree-1-does-it-have/
http://mathematicssolution.com/a-tree-has-two-vertices-of-degree-2-one-vertex-of-degree-3-and-3-vertices-of-degree-4-how-many-vertices-of-degree-1-does-it-have/#respondTue, 26 Jan 2016 18:53:21 +0000http://mathematicssolution.com/?p=424http://mathematicssolution.com/a-tree-has-two-vertices-of-degree-2-one-vertex-of-degree-3-and-3-vertices-of-degree-4-how-many-vertices-of-degree-1-does-it-have/feed/0Absorption Property, Idempotent Property| Discrete mathematics
http://mathematicssolution.com/absorption-property-idempotent-property-discrete-mathematics/
http://mathematicssolution.com/absorption-property-idempotent-property-discrete-mathematics/#respondMon, 25 Jan 2016 18:07:59 +0000http://mathematicssolution.com/?p=411http://mathematicssolution.com/absorption-property-idempotent-property-discrete-mathematics/feed/0Both the join and meet operations are associative
http://mathematicssolution.com/both-the-join-and-meet-operations-are-associative/
http://mathematicssolution.com/both-the-join-and-meet-operations-are-associative/#respondSun, 24 Jan 2016 18:54:28 +0000http://mathematicssolution.com/?p=404http://mathematicssolution.com/both-the-join-and-meet-operations-are-associative/feed/0Show that R is a partially ordering relation.
http://mathematicssolution.com/show-that-r-is-a-partially-ordering-relation/
http://mathematicssolution.com/show-that-r-is-a-partially-ordering-relation/#respondFri, 22 Jan 2016 18:58:52 +0000http://mathematicssolution.com/?p=392http://mathematicssolution.com/show-that-r-is-a-partially-ordering-relation/feed/0Let R be a reflexive relation on a set A. Show that R is an equivalence relation if and only if (a,b) and (a,c) in R implies that (b,c) ∊R.
http://mathematicssolution.com/let-r-be-a-reflexive-relation-on-a-set-a-show-that-r-is-an-equivalence-relation-if-and-only-if-ab-and-ac-in-r-implies-that-bc-%e2%88%8ar/
http://mathematicssolution.com/let-r-be-a-reflexive-relation-on-a-set-a-show-that-r-is-an-equivalence-relation-if-and-only-if-ab-and-ac-in-r-implies-that-bc-%e2%88%8ar/#respondFri, 22 Jan 2016 18:49:22 +0000http://mathematicssolution.com/?p=389http://mathematicssolution.com/let-r-be-a-reflexive-relation-on-a-set-a-show-that-r-is-an-equivalence-relation-if-and-only-if-ab-and-ac-in-r-implies-that-bc-%e2%88%8ar/feed/0Let R be a transitive reflexive relation on A. Let T be a relation on A such that (a, b) ∊T if and only if both (a, b) ∊ T and (b, a) ∊ R. Show that T is equivalence relation.
http://mathematicssolution.com/let-r-be-a-transitive-reflexive-relation-on-a-let-t-be-a-relation-on-a-such-that-a-b-%e2%88%8at-if-and-only-if-both-a-b-%e2%88%8a-t-and-b-a-%e2%88%8a-r-show-that-t-is-equivalence-relation/
http://mathematicssolution.com/let-r-be-a-transitive-reflexive-relation-on-a-let-t-be-a-relation-on-a-such-that-a-b-%e2%88%8at-if-and-only-if-both-a-b-%e2%88%8a-t-and-b-a-%e2%88%8a-r-show-that-t-is-equivalence-relation/#respondWed, 13 Jan 2016 18:23:32 +0000http://mathematicssolution.com/?p=223http://mathematicssolution.com/let-r-be-a-transitive-reflexive-relation-on-a-let-t-be-a-relation-on-a-such-that-a-b-%e2%88%8at-if-and-only-if-both-a-b-%e2%88%8a-t-and-b-a-%e2%88%8a-r-show-that-t-is-equivalence-relation/feed/0Let R be a symmetric and transitive relation on a set. Show that for every a in A there exist b in A such that (a, b) ∊ R then R is an equivalence relation.
http://mathematicssolution.com/let-r-be-a-symmetric-and-transitive-relation-on-a-set-show-that-for-every-a-in-a-there-exist-b-in-a-such-that-a-b-%e2%88%8a-r-then-r-is-an-equivalence-relation/
http://mathematicssolution.com/let-r-be-a-symmetric-and-transitive-relation-on-a-set-show-that-for-every-a-in-a-there-exist-b-in-a-such-that-a-b-%e2%88%8a-r-then-r-is-an-equivalence-relation/#respondWed, 13 Jan 2016 18:19:27 +0000http://mathematicssolution.com/?p=221http://mathematicssolution.com/let-r-be-a-symmetric-and-transitive-relation-on-a-set-show-that-for-every-a-in-a-there-exist-b-in-a-such-that-a-b-%e2%88%8a-r-then-r-is-an-equivalence-relation/feed/0