Functions Course on Discrete Mathematics for GATE 2023 Sanchit Jain » Lesson 35 + Oct 13,2022Matching: - Let G be a graph, a subgraph M of G is called a matching of G, if every vertex of G is incident with at most one edge in M. deg(v) <= 1, V, Vev(G) 4 —o 4 « 4 c 4 € a 7 NX anne ax a b a b N | oe M, M, Ms My * In matching no two edges are adjacentMaximal Matching: - A matching M of a graph G is said to be maximal, if no other edges of G can be added to M, without violating the deg condition. Maximum Matching: - A matching of a graph with maximum no of edges is called a maximum matching of G. + Number of edges in a maximum matching of G is called matching number. a e gee ete toe <—1 Oo bPerfect Matching: - A matching of a graph in which every vertex is matched is called perfect matching. 1. Ifa graph G has a perfect match then no of vertices in G is even. 2. If no of vertexes is even, it is not necessary to have a perfect match. 3. No of perfect matchings are there in a complete graph K, is [(2n)!]/n!2" a ce 2 Tica 4 © a e a b \ zal a b e + i M. 1 M, M, uMQ How many perfect matchings are there in a complete graph of 6 vertices? (GATE- 2003) (2 Marks) (a) 15 (B) 24 (c) 30 (D) 60Covering Line Covering: - Let G (V, E) be a graph, a subset C of E is called a line covering of G, if every vertex of G is incident with at least one edge in C. (deg at least one) deg(v) >= 1 a eid, cy 2 © ae 4 4 a IN eine lS Rt Voge ee G G, co G im * Line covering of a graph G does not exist if G has an isolated vertex+> Minimal Line covering: - A line covering is said to be minimal if no edge can be deleted from the line covering, without destroying its ability to cover the graph. S -Cx, ‘+, Minimum line covering: - A line covering with minimum no of edges is called a minimum line covering C., © < a gece a s 4 e| On ree TTT I he Bice e \a i G G G G Line cdvering of a graph G does not exist if G has an isolated vertex CAD* No of edges in minimum line covering is called line covering number of a graph G, denoted by ine covering of a graph within vertices contain at least upper bound(n/2) edges. * no minimal line covering can contain a cycle=—Independent Line set: - Let G (V, E) be a graph, a subset L of E is called independent line set of G, if no two edges are adjacent. L, = {(b, d)} a e. L, ={(b, d), (e, fl} L, = {(a, d), (b, c), (e, f)} L, = {(a, b), (e, f}+ Maximal independent Line set: - An independent line set L of a graph G is said to be maximal if no other edges of G can be added tol. — = 1s + Maximum independent line set: - An independent line set L of a graph G, with maximum no of edges is called maximum independent line set. — “> * No of edges in maximum independent line set is called independent aumber of G denoted (P,_») * line independent no = matching no of G cr a, +B,= IvI cd aes | L, = {(b, d), (e, f)} 4 \—_! © L; = {(a, d), (b,c), (e, f)} L.=4lacb}-te-f)}Vertex Covering: - Let G (V, E) be graph, a subset K of V is called a vertex coving of G. if every edge of G is incident with a vertex in K. a ra K, = {b, d} K, = {a, b, c} K, = {b, c, d} a bMinimal vertex cover: - Vertex covering K of a graph G is said to be minimal if no vertex can be deleted from K, without violating the condition. “. “x Minimum vertex covering: - A vertex covering of a graph G with minimum number of vertices is called as minimum vertex covering— “\ + No of vertices in a minimum vertex covering is called vertex Covering no of graph G denoted by a, cb Ky aX)QA vertex cover of an undirected graph G(V, E) is a subset V, S V vertices such that (NET-JUNE- 2013) (A) Each pair of vertices in V, is connected by an edge (B) If (u, v) € E then u EV, andve V, (C) If (u, v) EE thenu€V, orveV, (D) All pairs of vertices in V, are not connected by an edgeIndependent vertex set: - let G (V, E) be a graph, a subset S of V is called an independent vertex set if no two vertices in S are adjacent. S; = {b} A “ S, = {d, e} S3 = {a, c}Maximum independent Vertex Set: - An independent vertex set is said to be maximal, if no other vertex of G can be added to the set. St, Sx, $5 Maximum independent vertex set: - An independent vertex set of graph G with maximum no of vertices is called maximum independent vertex set. —-S> The number of vertices in maximum independent vertex set is called as vertex independent number of G donated by B, SSS a, +B, = |V| EN S,= {b} S, = {d, e} S, = {a, c, e} eQ What is the size of the smallest MIS' i endent Sét)-of a chain of nine nodes? (GATE-2008) (1 Marks) (c) (D) 2 . as (8)4 SQ Let G be a simple graph with2@-vertices and 100-edges. The size of the minimum vertex cover of G is 8hen, the size of the maximum independent set of G is (GATE-2005) (1 Marks) {A (B) 8 (c) Less than8 (D) More than 12 eo \s Xs va MX, +h 2 ly SL Pe RoQA clique inasi : isa co. ‘. cl i i . How many cliques are there in the graph shown below? (NET-JULY-2016) aL b wq pce Ky LN] Af OO] OT ye e| Cee aaQin a connected graph, a bridge is an edge whose removal disconnects a graph. Which one of the following statements is True? (GATE-2015) (2 Marks) (A) A tree has no bridgs T (B) A bridge cannot be part of a simple cycle= = (C) Every edge of aclique with size 2 3 is a bridge (A clique is any comp lete subgraph of a grdph) (D) A graph with bridges cannot have a cycle ( ne of the above — | 7 [ales \aeU 7 —_ — P= 6 23Q Let X, Y, Z be sets of sizes x, y and z respectively. Let W = X x Y. Let E be the set of all subsets of W. The number of functions from Z to E is (GATE- 2006) (1 Marks) oa (A) 24 (B)Z xe (ch em [X]= > [Wh = ry 2—— FE [YJe Puez=e 2 2 24 (2) = BAe we (ary) i 2Q Let S denote the set of all functions f: {0,1} -> {0,1}. Denote by N the number of functions from S to the set {0,1}. The value of Log,Log,N is - (GATE-2014) (2 Marks)QA function f:N*->N*, defined on the set of positive integers N’, satisfies the following properties: f(n)=f(n/2) if nis even f(n)=f(n+5) if nis odd Let R={i | 3j : f(j)=i} be the set of distinct values that f takes. The maximum possible size of R is (GATE-2016) (2 Marks)Q Let X and Y be finite sets and f: X -> Y be a function. Which one of the following statements is TRUE? (GATE-2014) (1 Marks) Ht a) For any subsets A and B of X,| f(A U B)| = |f(A)| + |f(B)| b) For any subsets A and B of X, f(A n B) = f(A) 9 f(B) ¢) For any subsets A and B of X,| f(A 0 B)| = min{| f(A), 1f(8)|} d) For any subsets S and T of ¥,F4(S 9 T) = f4(S) 9 F(T)Q Let f: AB be a function, and let E and F be subsets of A. Consider the following statements about images. Sy: f (E UF) =f (E) Uf (F) S,: f (E.9 F) =f (E) 9 f (F) Which of the following is true about $1 and S2? (GATE-2001) (2 Marks) (A) Only S1 is correct (B) Only S2 is correct (C) Both S1 and S2 are correct (D) None of $1 and $2 is correctFunction composition * In mathematics, function composition is an operation that takes two functions f and g and produces a function h such that h(x) = 9(f(x)). + In this operation, the function g is applied to the result of applying the function f to x. That is, the functions f: X > Y and g: Y > Zare composed to yield a function that maps x in X to g(f(x)) in Z. yi g* fog(x) = f(g(x)) + gof(x) = g(f(x)) Composition of functions on a finite set: If f= {(1, 3), (2, 1), (3, 4), (4, 6)}, and g = {(1, 5), (2, 3), (3, 4), (4, 1), (5, 3), (6, 2)}, then g © f = {(1, 4), (2, 5), (3, 1), (4, 2)}. The composition of functions is always associative—a property inherited from the composition of relations. That is, if f, g, and h are three functions with suitably chosen domains and codomains, then fe (ge h) = (fe g)ohQ If g(x) = 1-x and h(x)=x / —— then a(h(x)) / — is: (GATE-2015) (1 Marks) a) h(x) / Bl) ‘b)-1 €) g(x) / h(x) d) x /(1-x?Q Let f and g be the functions from the set of integers defined by f(x)=2x+3 and g(x)=3x+2. Then the composition of f and g and g and f is given as (NET-Jan-2013) a) 6x+7, 6x+11 b) 6x+11, 6x+7 c) 5x+5, 5x+5 d) None of the aboveQ The functions mapping R into R are defined as: f(x) = x? — 4x, g(x) = 1 / (x? + 1) and h(x) = x’. Then find the value of the following composite functions: hog(x) and hogof(x). (NET-Jan-2018) a) (x2 + 1)4 and [(x? — 4x)? + 4]! b) (x2 + 1)4 and [(x? - 4x)? + 1] c) (x2 +1) and [(2 — 4x)? + 1] d)(x2 + 1)-4 and [(x3 - 4x)? + 1]Qf we define the functions f, g and h that map R into R by : f(x) = x*, g(x) = VO2 + 1), h(x) = x? + 72, then the value of the composite functions ho(gof) and (hog)of are given as (NET-Dec-2014) (A) x8- 71 and x8-71 (B) x®- 73 and x8 - 73 (C) x8 + 71 and x8 +71 (D) x8 + 73 and x8 + 73* An injective function (also known as injection, or one-to-one function) is a function that maps distinct elements of its domain to distinct elements of its codomain. In other words, every element of the function's codomain is the image of at most one element of its domain.One-to-One (Injective Function) * A function F: AB is said to be one-to-one function if every element of A has distinct image in B * fA 6 ‘ ‘8 set, then one-to-one from AB is possible Y F ie re :* No of function possible = ?* No of function possible = "p,, = P (n, m) * If [A] = |B] =n, then no of functions possible is mn Ne? 4 ne Ye rs Dl na): s g 5 & if 3| fs ea me, — vlQLet X and Y denote the sets containing 2 and 20 distinct objects respectively and F denote the set of all possible functions defined from X and Y. Let f be randomly chosen from F. The probability of f being one-to-one is__ CS. (GATE-2015) (2 Marks) K ee 22 fo, Leo / 14? “A ae Ry seOnto (Surjective Function) * A function f from a set X to a set Y is surjective (also known as onto, or a surjection), if for every element y in the co-domain Y of f, there is at least one element x in the domain X of f such that f(x) = y. It is not required that x be unique; the function f may map one or more elements of X to the same element of Y. ‘ ZaOnto (Surje Function) * A function f: A > B is said to be onto if and only if every element of B is mapped by at least one element of A. * Range of f=B iv \/ ©) GE) GE a Z a + If Aand B are finite sets, then onto function from A->B is possible, |B|<=|A| + If [Al = [BI, then every onto function from A to B is also one-to-one function.No of onto function possible from A to B =?No of onto function possible fro toB me ned en™"e{(n-1 + eal -2)™ "esl tact (1) gg 1 4 7 S 781 8e @-D ihe Q-d 5 Wo ea 8 = Q\ HS +Q The numberof onto functions rjective functi from set X = {1, 2, 3, 4} to set Y = {a, b, c} is (GATE-2015) (2 Marks) Lx \e \“=>QHow many onto (or surjective) functions are there from an n-element (n >= 2) set to a 2-element set? (GATE-2014) jarks) (A) 2.2 (B) 22-1 (c a Z (D) 2(2"- 2). mw hy ba hy Fan Gay 4 MG GAD TH My (Aa ES = a Kn L- %, eY = 2 - 4 LED Mon W=vQ Consider the set of all functions f: {0,1, ... 2014} > {0,1, ... 2014} such that f(f(i)] < 2014. Consider the following statements: (GATE-2014) (2 Marks) P. For each such function it must be the case that for every i, f(i)=i. Q. For each such function it must be the case that for some i, f(i)=i R. Each function must be onto. ) =i, for allO af Le f eet 4]7 xX b \/ iw, \_/ | | © Inverse of a function f: AB exists, iff f: ADB is a bijection.* f(x) =5x-7 + Fy) = (y+ 7/5Q Let R denote the set of real numbers. Let f: RxR->RxR be a bijective function defined by f (x, y) = (x+y, X- y). The inverse function of fis given by (GATE-1996) (2 Marks) a) F(x, y=(1/ (x + y), 1/ (x-y)) bpm nay S lo OW aston (x+y) /2, (xy) /2) A = 6 eS Bigs oe ) F(x, y)=[2(x - y),2(x + y-L ‘i es Ory, X-4) soy Cu, yy SyQLet f: B > Cand g: A > B be two functions and let h = f 0 g. Given that h is an onto function. Which one of the following is TRUE? (GATE-2005) (2 Marks) (A) f and g should both be onto functions (B) f should be onto but g need not be onto (C) g should be onto but f need not be onto (D) both f and g need not be ontoQ Let f be a function from a set A to a set B, ga function from B to C, andha function from A to C, such that h(a) = g(f(a)) for all a € A. Which of the following statements is always true for all such functions f and g? (GATE-2005) (2 Marks) (A) gis onto => his onto (B) h is onto => fis onto (C) his onto => g is onto (D) h is onto => f and g are ontoQFor the set N of natural numbers and a binary operation f: N x N -> N, an element z EN is called an identity for f, if f (a, z) = a = f (2, a), for all a € N. Which of the following binary operations an identity? (GATE-2006) (1 Marks) Lf y=xty 2. f(x, y) = max (x, y) 3. f(x y) =x" (A) land It only (B) Il and Il only (C) land Il only (D) None of theseQ Consider a sequence F,, defined as : (NET-Jan-2017) Foo(0) = 1 Foo(1) = 1 Foo(n) = [10 * Fog(n — 1) + 100] / [Foo *(n — 2)] for n> 2 Then what shall be the set of values of the sequence Fo, ? a) (1, 110, 1200) b) (1, 110, 600, 1200) ¢) (1, 2, 55, 110, 600, 1200) d) (1, 55, 110, 600, 1200)Let N be the set of natural numbers. Consider the following sets. -P: Set of Rational numbers (positive and negative) Q: Set of functions from {0, 1} to N R: Set of functions from N to {0, 1} S: Set of finite subsets of N. Which of the sets above are countable? (GATE-2018) (1 Marks) (A) Qand 5 only (B) P and S only (C) P and R only (D)P, QandS onlyQ.17 Consider the following sets, where n > 2: (GATE-2021) S, : Set of all nx n matrices with entries from the set (a, b, c} S, : Set of all functions from the set (0, 1, 2, ..., A — 1} to the set (0, 1, 2} Which of the following choice(s) is/are correct? (@) There exists a surjection from S, to S,. (b) There does not exist a bijection from S, to S, (©) There does not exist an injection from S, to S,. (d) There exists a bijection from S, to S,. Ans. (a, d)